Black-Box Identity Testing of Depth-4 Multilinear Circuits
暂无分享,去创建一个
[1] Nitin Saxena,et al. Identity Testing for constant-width, and commutative, read-once oblivious ABPs , 2016, Electron. Colloquium Comput. Complex..
[2] Russell Impagliazzo,et al. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.
[3] Neeraj Kayal,et al. Polynomial Identity Testing for Depth 3 Circuits , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).
[4] Zeev Dvir,et al. Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits , 2009, SIAM J. Comput..
[5] Partha Mukhopadhyay,et al. Depth-4 Identity Testing and Noether's Normalization Lemma , 2016, CSR.
[6] Vikraman Arvind,et al. The ideal membership problem and polynomial identity testing , 2010, Inf. Comput..
[7] Fan Chung Graham,et al. Some intersection theorems for ordered sets and graphs , 1986, J. Comb. Theory, Ser. A.
[8] Pascal Koiran,et al. Arithmetic circuits: The chasm at depth four gets wider , 2010, Theor. Comput. Sci..
[9] Ankit Gupta. Algebraic Geometric Techniques for Depth-4 PIT & Sylvester-Gallai Conjectures for Varieties , 2014, Electron. Colloquium Comput. Complex..
[10] Nitin Saxena,et al. Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits , 2014, SIAM J. Comput..
[11] Ilya Volkovich,et al. Read-once polynomial identity testing , 2008, computational complexity.
[12] Noga Alon. Combinatorial Nullstellensatz , 1999, Combinatorics, Probability and Computing.
[13] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[14] Nitin Saxena,et al. Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter , 2010, STOC '11.
[15] Vikraman Arvind,et al. The Monomial Ideal Membership Problem and Polynomial Identity Testing , 2007, ISAAC.
[16] Ran Raz,et al. A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[17] Daniel A. Spielman,et al. Randomness efficient identity testing of multivariate polynomials , 2001, STOC '01.
[18] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[19] Zeev Dvir,et al. Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits , 2007, SIAM J. Comput..
[20] Adi Shamir,et al. IP = PSPACE , 1992, JACM.
[21] Nitin Saxena,et al. Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs , 2014, computational complexity.
[22] Manindra Agrawal,et al. PRIMES is in P , 2004 .
[23] Amir Shpilka,et al. Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in , 2011, Comb..
[24] Ramprasad Saptharishi,et al. Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order , 2013, Electron. Colloquium Comput. Complex..
[25] Shubhangi Saraf,et al. Sums of products of polynomials in few variables : lower bounds and polynomial identity testing , 2015, CCC.
[26] Ilya Volkovich,et al. Deterministic polynomial identity tests for multilinear bounded-read formulae , 2015, computational complexity.
[27] Richard J. Lipton,et al. A Probabilistic Remark on Algebraic Program Testing , 1978, Inf. Process. Lett..
[28] Nitin Saxena,et al. Algebraic independence and blackbox identity testing , 2011, Inf. Comput..
[29] Nitin Saxena,et al. Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits , 2011, STOC '12.
[30] Shubhangi Saraf,et al. Blackbox Polynomial Identity Testing for Depth 3 Circuits , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[31] Amir Shpilka,et al. Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.
[32] Amir Shpilka,et al. Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing , 2013, APPROX-RANDOM.
[33] Amir Yehudayoff,et al. Arithmetic Circuits: A survey of recent results and open questions , 2010, Found. Trends Theor. Comput. Sci..
[34] Manindra Agrawal,et al. Proving Lower Bounds Via Pseudo-random Generators , 2005, FSTTCS.
[35] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[36] Ran Raz,et al. Lower Bounds and Separations for Constant Depth Multilinear Circuits , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[37] Shubhangi Saraf,et al. Arithmetic Circuits with Locally Low Algebraic Rank , 2016, Computational Complexity Conference.
[38] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[39] Joos Heintz,et al. Testing polynomials which are easy to compute (Extended Abstract) , 1980, STOC '80.
[40] Satyanarayana V. Lokam,et al. Reconstruction of depth-4 multilinear circuits with top fan-in 2 , 2012, STOC '12.
[41] Sébastien Tavenas,et al. Improved bounds for reduction to depth 4 and depth 3 , 2013, Inf. Comput..
[42] V. Vinay,et al. Arithmetic Circuits: A Chasm at Depth Four , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[43] Neeraj Kayal,et al. Arithmetic Circuits: A Chasm at Depth Three , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[44] Nisheeth K. Vishnoi,et al. Deterministic identity testing for multivariate polynomials , 2003, SODA '03.
[45] Nitin Saxena,et al. Diagonal Circuit Identity Testing and Lower Bounds , 2008, ICALP.
[46] Nitin Saxena,et al. From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits , 2010, FOCS.
[47] Ilya Volkovich,et al. Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in , 2013, SIAM J. Comput..
[48] Amir Shpilka,et al. Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[49] Nitin Saxena,et al. An Almost Optimal Rank Bound for Depth-3 Identities , 2011, SIAM J. Comput..
[50] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1992, JACM.
[51] László Lovász,et al. On determinants, matchings, and random algorithms , 1979, International Symposium on Fundamentals of Computation Theory.
[52] Nitin Saxena,et al. Quasi-polynomial hitting-set for set-depth-Δ formulas , 2012, STOC '13.
[53] Ilya Volkovich,et al. On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors , 2010, ICALP.
[54] Ramprasad Saptharishi,et al. Identity Testing and Lower Bounds for Read-$k$ Oblivious Algebraic Branching Programs , 2015, Electron. Colloquium Comput. Complex..
[55] Ilya Volkovich,et al. Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[56] Amir Shpilka,et al. Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas , 2016, computational complexity.