The following pages link to (Q4263835):
Displaying 19 items.
- Proof theory for reasoning with Euler diagrams: a logic translation and normalization (Q361868) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Interpolants, cut elimination and flow graphs for the propositional calculus (Q674415) (← links)
- Short proofs of the Kneser-Lovász coloring principle (Q1641004) (← links)
- Quasipolynomial size proofs of the propositional pigeonhole principle (Q2344736) (← links)
- Analyzing read-once cutting plane proofs in Horn systems (Q2673307) (← links)
- Minimum propositional proof length is NP-hard to linearly approximate (Q2732273) (← links)
- Complexity of propositional proofs under a promise (Q2946606) (← links)
- Propositional Proofs in Frege and Extended Frege Systems (Abstract) (Q3194704) (← links)
- NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability (Q3386749) (← links)
- Short Proofs of the Kneser-Lovász Coloring Principle (Q3449464) (← links)
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic (Q4358049) (← links)
- Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk) (Q4649532) (← links)
- (Q4790380) (← links)
- Substitution and Propositional Proof Complexity (Q5027247) (← links)
- The Complexity of Finding Read-Once NAE-Resolution Refutations (Q5224491) (← links)
- The NP Search Problems of Frege and Extended Frege Proofs (Q5278209) (← links)
- Uniform Proof Complexity (Q5696301) (← links)
- Proving the infeasibility of Horn formulas through read-once resolution (Q6558679) (← links)
