Witnessing matrix identities and proof complexity
暂无分享,去创建一个
[1] Stephen Cook,et al. Corrections for "On the lengths of proofs in the propositional calculus preliminary version" , 1974, SIGA.
[2] Iddo Tzameret. Algebraic proofs over noncommutative formulas , 2011, Inf. Comput..
[3] Stephen A. Cook,et al. The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.
[4] Ran Raz,et al. Deterministic polynomial identity testing in non-commutative models , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[5] A. S. Amitsur,et al. Minimal identities for algebras , 1950 .
[6] Partha Mukhopadhyay,et al. Randomized polynomial time identity testing for noncommutative circuits , 2016, STOC.
[7] A. R. Kemer,et al. Finite basis property of identities of associative algebras , 1987 .
[8] Emil Jerábek,et al. Dual weak pigeonhole principle, Boolean complexity, and derandomization , 2004, Annals of Pure and Applied Logic.
[9] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[10] Fu Li,et al. Non-Commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs , 2015, Computational Complexity Conference.
[11] Alexei Kanel-Belov,et al. Kemer's Theorem for Affine PI Algebras Over a Field of Characteristic Zero , 2016 .
[12] Anna Papst. Bounded Arithmetic Propositional Logic And Complexity Theory , 2016 .
[13] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[14] Francesca Benanti,et al. Computational Approach to Polynomial Identities of Matrices – a Survey , 2004 .
[15] Iddo Tzameret,et al. The Proof Complexity of Polynomial Identities , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.
[16] V. S. Drenski,et al. A minimal basis of identities for a second-order matrix algebra over a field of characteristic o , 1981 .
[17] Alexander R. Kemer. Identities of Associative Algebras , 2010 .
[18] Amir Yehudayoff,et al. Arithmetic Complexity in Ring Extensions , 2011, Theory Comput..
[19] Pavel Hrubes. How much commutativity is needed to prove polynomial identities? , 2011, Electron. Colloquium Comput. Complex..
[20] Ran Raz,et al. Deterministic polynomial identity testing in non commutative models , 2004 .
[21] Iddo Tzameret,et al. Short proofs for the determinant identities , 2012, STOC '12.
[22] Steve Chien,et al. Algebras with polynomial identities and computing the determinant , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[23] Louis Rowen,et al. Polynomial identities in ring theory , 1980 .
[24] Toniann Pitassi,et al. Circuit Complexity, Proof Complexity, and Polynomial Identity Testing , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[25] Russell Impagliazzo,et al. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.
[26] Uri Leron. Multilinear identities of the matrix ring , 1973 .
[27] Toniann Pitassi,et al. Algebraic proof complexity: progress, frontiers and challenges , 2016, SIGL.