Pages that link to "Item:Q4892411"
From MaRDI portal
The following pages link to Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs (Q4892411):
Displaying 21 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)
- Lov\'asz Meets Weisfeiler and Leman (Q5002713) (← 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)
- Propositional proof complexity (Q6064569) (← links)
