Pages that link to "Item:Q4892411"
From MaRDI portal
The following pages link to Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs (Q4892411):
Displayed 38 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Propositional proofs and reductions between NP search problems (Q435190) (← links)
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← links)
- \(\text{Count}(q)\) does not imply \(\text{Count}(p)\) (Q1377601) (← links)
- Algebraic proof systems over formulas. (Q1401356) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- On the complexity of Hilbert refutations for partition (Q2252121) (← links)
- On transformations of constant depth propositional proofs (Q2311211) (← links)
- Another look at degree lower bounds for polynomial calculus (Q2333803) (← 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)
- Separation results for the size of constant-depth propositional proofs (Q2566064) (← links)
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
- A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems (Q2944868) (← links)
- Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908) (← links)
- (Q3304105) (← links)
- Limitations of Algebraic Approaches to Graph Isomorphism Testing (Q3448781) (← links)
- Phase transition of multivariate polynomial systems (Q3616213) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- Conservative Retractions of Propositional Logic Theories by Means of Boolean Derivatives: Theoretical Foundations (Q3637268) (← links)
- Characterizing Propositional Proofs as Noncommutative Formulas (Q4577770) (← links)
- Proof Complexity Meets Algebra (Q4617977) (← links)
- Lov\'asz Meets Weisfeiler and Leman (Q5002713) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← 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)
- Formal Verification of Integer Multiplier Circuits Using Algebraic Reasoning: A Survey (Q5157436) (← links)
- Parameterized Complexity of DPLL Search Procedures (Q5892559) (← links)
- Proof Complexity of Non-classical Logics (Q5894972) (← links)
- The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5896088) (← links)
- The classes PPA-\(k\): existence from arguments modulo \(k\) (Q5918090) (← links)
- Uniformly generated submodules of permutation modules over fields of characteristic 0. (Q5939910) (← 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)
- Sharp Effective Finite-Field Nullstellensatz (Q6058311) (← links)
- Propositional proof complexity (Q6064569) (← links)