Pages that link to "Item:Q5943090"

The following pages link to Linear gaps between degrees for the polynomial calculus modulo distinct primes (Q5943090):

Displayed 15 items.

• Towards NP-P via proof complexity and search (Q408544) ‎ (← links)
• Algebraic proofs over noncommutative formulas (Q642520) ‎ (← links)
• Resolution over linear equations and multilinear proofs (Q952492) ‎ (← links)
• Algebraic proof systems over formulas. (Q1401356) ‎ (← links)
• Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) ‎ (← links)
• The complexity of the Hajós calculus for planar graphs (Q2268877) ‎ (← links)
• Efficient algorithms for privately releasing marginals via convex relaxations (Q2349860) ‎ (← links)
• Several notes on the power of Gomory-Chvátal cuts (Q2498920) ‎ (← links)
• Polynomial-size Frege and resolution proofs of \(st\)-connectivity and Hex tautologies (Q2500481) ‎ (← links)
• A Framework for Space Complexity in Algebraic Proof Systems (Q2796410) ‎ (← links)
• Space Complexity in Polynomial Calculus (Q2944568) ‎ (← links)
• Limitations of Algebraic Approaches to Graph Isomorphism Testing (Q3448781) ‎ (← links)
• Proof Complexity Meets Algebra (Q4617977) ‎ (← links)
• The Complexity of Propositional Proofs (Q5444711) ‎ (← links)
• Complexity of Null- and Positivstellensatz proofs (Q5957910) ‎ (← links)