The following pages link to (Q3444802):
Displaying 8 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs (Q1983330) (← links)
- Characterizing Tseitin-formulas with short regular resolution refutations (Q2118291) (← links)
- Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures (Q2884578) (← links)
- Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies (Q3613770) (← links)
- TLA + Proofs (Q4647839) (← links)
- Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. (Q5111240) (← links)
- Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative? (Q6562829) (← links)