Algebraic proofs over noncommutative formulas (Q642520): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ic.2011.07.004
+Normal rank
@@ Property / OpenAlex ID @@
+W4212786702
@@ Property / OpenAlex ID: W4212786702 / rank @@
+Normal rank
@@ Property / cites work @@
+Space Complexity in Propositional Calculus
@@ Property / cites work: Space Complexity in Propositional Calculus / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandom Generators in Propositional Proof Complexity
+Normal rank
@@ Property / cites work @@
+Monotone simulations of non-monotone proofs.
@@ Property / cites work: Monotone simulations of non-monotone proofs. / rank @@
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2004
+Normal rank
@@ Property / cites work @@
+Random CNF's are hard for the polynomial calculus
@@ Property / cites work: Random CNF's are hard for the polynomial calculus / rank @@
+Normal rank
@@ Property / cites work @@
+Linear gaps between degrees for the polynomial calculus modulo distinct primes
+Normal rank
@@ Property / cites work @@
+Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
+Normal rank
@@ Property / cites work @@
+Q4228469
@@ Property / cites work: Q4228469 / rank @@
+Normal rank
@@ Property / cites work @@
+The relative efficiency of propositional proof systems
+Normal rank
@@ Property / cites work @@
+Algebraic proof systems over formulas.
@@ Property / cites work: Algebraic proof systems over formulas. / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for the polynomial calculus and the Gröbner basis algorithm
+Normal rank
@@ Property / cites work @@
+Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs
+Normal rank
@@ Property / cites work @@
+An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams
+Normal rank
@@ Property / cites work @@
+An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle
+Normal rank
@@ Property / cites work @@
+Q4353563
@@ Property / cites work: Q4353563 / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential lower bounds for the pigeonhole principle
+Normal rank
@@ Property / cites work @@
+Q4934563
@@ Property / cites work: Q4934563 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002768
@@ Property / cites work: Q3002768 / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-linear formulas for permanent and determinant are of super-polynomial size
+Normal rank
@@ Property / cites work @@
+Deterministic polynomial identity testing in non-commutative models
+Normal rank
@@ Property / cites work @@
+Resolution over linear equations and multilinear proofs
+Normal rank
@@ Property / cites work @@
+The strength of multilinear proofs
@@ Property / cites work: The strength of multilinear proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for the polynomial calculus
@@ Property / cites work: Lower bounds for the polynomial calculus / rank @@
+Normal rank
@@ Property / cites work @@
+On the descriptive and algorithmic power of parity ordered binary decision diagrams
+Normal rank