Pages that link to "Item:Q1961057"

The following pages link to Lower bounds for the polynomial calculus and the Gröbner basis algorithm (Q1961057):

Displaying 39 items.

• Towards NP-P via proof complexity and search (Q408544) (← links)
• Algebraic proofs over noncommutative formulas (Q642520) (← links)
• Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz (Q650840) (← links)
• Exploring the vacuum geometry of \(\mathcal N=1\) gauge theories (Q879888) (← links)
• Lower bounds for the polynomial calculus (Q1293358) (← links)
• Algebraic proof systems over formulas. (Q1401356) (← links)
• Degree complexity for a modified pigeonhole principle (Q1407601) (← links)
• Homogenization and the polynomial calculus (Q1430569) (← links)
• On the automatizability of polynomial calculus (Q1959382) (← links)
• Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
• On the complexity of Hilbert refutations for partition (Q2252121) (← links)
• Another look at degree lower bounds for polynomial calculus (Q2333803) (← links)
• Resolution over linear equations modulo two (Q2334112) (← links)
• A framework for space complexity in algebraic proof systems (Q2796410) (← links)
• Space Complexity in Polynomial Calculus (Q2944568) (← links)
• A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems (Q2944868) (← links)
• The relation between polynomial calculus, Sherali-Adams, and sum-of-squares proofs (Q3304105) (← links)
• Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz (Q3552513) (← links)
• (Q4464663) (← links)
• Algebraic Attacks against Random Local Functions and Their Countermeasures (Q4600698) (← links)
• Proof Complexity Meets Algebra (Q4617977) (← links)
• (Q4625692) (← links)
• (Q5028363) (← links)
• Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)
• Size-degree trade-offs for sums-of-squares and positivstellensatz proofs (Q5091776) (← links)
• Sum of squares bounds for the ordering principle (Q5092489) (← links)
• Narrow Proofs May Be Maximally Long (Q5277920) (← links)
• The Complexity of Propositional Proofs (Q5444711) (← links)
• Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity (Q5941296) (← links)
• Linear gaps between degrees for the polynomial calculus modulo distinct primes (Q5943090) (← links)
• Complexity of Null- and Positivstellensatz proofs (Q5957910) (← links)
• Space characterizations of complexity measures and size-space trade-offs in propositional proof systems (Q6168323) (← links)
• On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (Q6184293) (← links)
• Perfect matching in random graphs is as hard as Tseitin (Q6562700) (← links)
• Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative? (Q6562829) (← links)
• Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
• First-order reasoning and efficient semi-algebraic proofs (Q6614038) (← links)
• Cutting planes width and the complexity of graph isomorphism refutations (Q6636618) (← links)
• Practical algebraic calculus and Nullstellensatz with the checkers Pacheck and Pastèque and Nuss-Checker (Q6661748) (← links)