暂无分享,去创建一个
[1] David A. Cox,et al. Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics) , 2007 .
[2] Ilya Volkovich,et al. Improved Polynomial Identity Testing for Read-Once Formulas , 2009, APPROX-RANDOM.
[3] Jan Krajícek,et al. Proof complexity in algebraic systems and bounded depth Frege systems with modular counting , 1997, computational complexity.
[4] Ran Raz,et al. Separation of Multilinear Circuit and Formula Size , 2006, Theory Comput..
[5] Toniann Pitassi,et al. Algebraic Propositional Proof Systems , 1996, Descriptive Complexity and Finite Models.
[6] Ran Raz,et al. Deterministic polynomial identity testing in non-commutative models , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[7] 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.
[8] Dima Grigoriev,et al. Algebraic proof systems over formulas , 2001, Electron. Colloquium Comput. Complex..
[9] Noam Nisan,et al. Lower bounds on arithmetic circuits via partial derivatives , 2005, computational complexity.
[10] Pavel Pudlák,et al. Lower bounds for resolution and cutting plane proofs and monotone computations , 1997, Journal of Symbolic Logic.
[11] Ilya Volkovich,et al. Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[12] Amir Shpilka,et al. Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas , 2016, computational complexity.
[13] Marek Karpinski,et al. An exponential lower bound for depth 3 arithmetic circuits , 1998, STOC '98.
[14] Samuel R. Buss,et al. Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes , 2001, J. Comput. Syst. Sci..
[15] Anna Papst. Bounded Arithmetic Propositional Logic And Complexity Theory , 2016 .
[16] Nitin Saxena,et al. Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs , 2016, computational complexity.
[17] Jan Krajícek,et al. Lower bounds on Hilbert's Nullstellensatz and propositional proofs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[18] Toniann Pitassi,et al. Circuit Complexity, Proof Complexity, and Polynomial Identity Testing , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[19] Zeev Dvir,et al. Hardness-randomness tradeoffs for bounded depth arithmetic circuits , 2008, SIAM J. Comput..
[20] Neeraj Kayal,et al. Approaching the Chasm at Depth Four , 2013, 2013 IEEE Conference on Computational Complexity.
[21] Ramprasad Saptharishi,et al. Hitting sets for multilinear read-once algebraic branching programs, in any order , 2014, STOC.
[22] Russell Impagliazzo,et al. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.
[23] Iddo Tzameret. Algebraic Proofs over Noncommutative Formulas , 2010, TAMC.
[24] Alexander A. Razborov,et al. Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields , 2000, Applicable Algebra in Engineering, Communication and Computing.
[25] Ramprasad Saptharishi,et al. Identity Testing and Lower Bounds for Read-$k$ Oblivious Algebraic Branching Programs , 2015, Electron. Colloquium Comput. Complex..
[26] Neeraj Kayal,et al. Arithmetic Circuits: A Chasm at Depth Three , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[27] Nitin Saxena,et al. Deterministic Identity Testing for Sum of Read Once ABPs , 2014, Electron. Colloquium Comput. Complex..
[28] Daniel A. Spielman,et al. Randomness efficient identity testing of multivariate polynomials , 2001, STOC '01.
[29] Avi Wigderson,et al. P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.
[30] Ilya Volkovich,et al. Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials , 2015, APPROX-RANDOM.
[31] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[32] Iddo Tzameret,et al. Short proofs for the determinant identities , 2012, STOC '12.
[33] Stephen A. Cook,et al. The proof complexity of linear algebra , 2004, Ann. Pure Appl. Log..
[34] J. von zur Gathen. Factoring sparse multivariate polynomials , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[35] Alexander A. Razborov,et al. Lower bounds for the polynomial calculus , 1998, computational complexity.
[36] Nitin Saxena,et al. Diagonal Circuit Identity Testing and Lower Bounds , 2008, ICALP.
[37] K. Ramachandra,et al. Vermeidung von Divisionen. , 1973 .
[38] Ran Raz,et al. Multi-linear formulas for permanent and determinant are of super-polynomial size , 2004, STOC '04.
[39] Neeraj Kayal. An exponential lower bound for the sum of powers of bounded degree polynomials , 2012, Electron. Colloquium Comput. Complex..
[40] Stephen A. Cook,et al. The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.
[41] Nitin Saxena,et al. Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits , 2014, SIAM J. Comput..
[42] Meena Mahajan,et al. Building above Read-once Polynomials: Identity Testing and Hardness of Representation , 2014, COCOON.
[43] Jan Krajícek,et al. Bounded arithmetic, propositional logic, and complexity theory , 1995, Encyclopedia of mathematics and its applications.
[44] Fu Li,et al. Non-Commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs , 2015, Computational Complexity Conference.
[45] Joos Heintz,et al. Testing polynomials which are easy to compute (Extended Abstract) , 1980, STOC '80.
[46] Erich Kaltofen,et al. Factorization of Polynomials Given by Straight-Line Programs , 1989, Adv. Comput. Res..
[47] Iddo Tzameret,et al. Short Proofs for the Determinant Identities , 2015, SIAM J. Comput..
[48] Ran Raz,et al. Balancing Syntactically Multilinear Arithmetic Circuits , 2008, computational complexity.
[49] Michael Alekhnovich,et al. Lower bounds for polynomial calculus: non-binomial case , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[50] Avi Wigderson,et al. Depth-3 arithmetic circuits over fields of characteristic zero , 2002, computational complexity.
[51] Ilya Volkovich,et al. Computations beyond Exponentiation Gates and Applications , 2015, Electron. Colloquium Comput. Complex..
[52] Alexander A. Razborov,et al. Exponential complexity lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[53] Amir Shpilka,et al. On identity testing of tensors, low-rank recovery and compressed sensing , 2011, STOC '12.
[54] Samuel R. Buss,et al. Linear gaps between degrees for the polynomial calculus modulo distinct primes , 1999, STOC '99.
[55] Zeev Dvir,et al. Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits , 2009, SIAM J. Comput..
[56] Stephen Cook,et al. Corrections for "On the lengths of proofs in the propositional calculus preliminary version" , 1974, SIGA.
[57] Michael A. Forbes. Polynomial identity testing of read-once oblivious algebraic branching programs , 2014 .
[58] Russell Impagliazzo,et al. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.
[59] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..
[60] Noam Nisan,et al. Lower bounds on arithmetic circuits via partial derivatives , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[61] Manindra Agrawal,et al. Proving Lower Bounds Via Pseudo-random Generators , 2005, FSTTCS.
[62] Russell Impagliazzo,et al. Lower bounds for the polynomial calculus and the Gröbner basis algorithm , 1999, computational complexity.
[63] Ramprasad Saptharishi,et al. Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity , 2016, Computational Complexity Conference.
[64] Amir Shpilka. Affine projections of symmetric polynomials , 2002, J. Comput. Syst. Sci..
[65] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[66] Rafael Oliveira,et al. Factors of low individual degree polynomials , 2015, computational complexity.
[67] Noam Nisan,et al. Lower bounds for non-commutative computation , 1991, STOC '91.
[68] Erich Kaltofen,et al. Factoring Sparse Multivariate Polynomials , 1983, J. Comput. Syst. Sci..
[69] Avi Wigderson,et al. Depth-3 arithmetic formulae over fields of characteristic zero , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[70] Noam Nisan,et al. Hardness vs Randomness , 1994, J. Comput. Syst. Sci..
[71] Amir Shpilka,et al. Complexity Theory Column 88 , 2015, SIGACT News.
[72] Russell Impagliazzo,et al. Using the Groebner basis algorithm to find proofs of unsatisfiability , 1996, STOC '96.
[73] Richard J. Lipton,et al. A Probabilistic Remark on Algebraic Program Testing , 1978, Inf. Process. Lett..
[74] Michael A. Forbes. Deterministic Divisibility Testing via Shifted Partial Derivatives , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[75] Ran Raz,et al. The Strength of Multilinear Proofs , 2008, computational complexity.
[76] Amir Shpilka,et al. Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing , 2013, APPROX-RANDOM.
[77] Amir Yehudayoff,et al. Arithmetic Circuits: A survey of recent results and open questions , 2010, Found. Trends Theor. Comput. Sci..
[78] David A. Cox,et al. Ideals, Varieties, and Algorithms , 1997 .
[79] Ran Raz,et al. Resolution over linear equations and multilinear proofs , 2007, Ann. Pure Appl. Log..
[80] Ran Raz,et al. Lower Bounds and Separations for Constant Depth Multilinear Circuits , 2008, Computational Complexity Conference.
[81] Ramprasad Saptharishi,et al. An exponential lower bound for homogeneous depth-5 circuits over finite fields , 2015, Electron. Colloquium Comput. Complex..
[82] I. Fischer. Sums of like powers of multivariate linear forms , 1994 .
[83] Dima Grigoriev,et al. Tseitin's tautologies and lower bounds for Nullstellensatz proofs , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[84] V. Rich. Personal communication , 1989, Nature.
[85] Nitin Saxena,et al. Quasi-polynomial hitting-set for set-depth-Δ formulas , 2012, STOC '13.
[86] Toniann Pitassi,et al. Propositional Proof Complexity: Past, Present and Future , 2001, Bull. EATCS.