Pages that link to "Item:Q5444711"
From MaRDI portal
The following pages link to The Complexity of Propositional Proofs (Q5444711):
Displaying 49 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Rank bounds for a hierarchy of Lovász and Schrijver (Q498445) (← links)
- The depth of resolution proofs (Q647405) (← links)
- Proof complexity of modal resolution (Q832717) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- Symbolic techniques in satisfiability solving (Q862403) (← links)
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← links)
- Short proofs of the Kneser-Lovász coloring principle (Q1641004) (← links)
- A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games (Q1675824) (← links)
- Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
- Understanding cutting planes for QBFs (Q1784953) (← links)
- Improved algorithms for optimal length resolution refutation in difference constraint systems (Q1941901) (← links)
- Lower bound techniques for QBF expansion (Q1987510) (← links)
- The treewidth of proofs (Q2013559) (← links)
- From truth degree comparison games to sequents-of-relations calculi for Gödel logic (Q2169133) (← links)
- Partially definable forcing and bounded arithmetic (Q2257103) (← links)
- The complexity of the Hajós calculus for planar graphs (Q2268877) (← links)
- Limitations of restricted branching in clause learning (Q2272157) (← links)
- Strong extension-free proof systems (Q2303251) (← links)
- Normality, non-contamination and logical depth in classical natural deduction (Q2307304) (← links)
- Quasipolynomial size proofs of the propositional pigeonhole principle (Q2344736) (← links)
- A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
- A simple proof of QBF hardness (Q2656352) (← links)
- A Game Characterisation of Tree-like Q-resolution Size (Q2799200) (← links)
- Lifting QBF Resolution Calculi to DQBF (Q2818035) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas (Q2988835) (← links)
- Propositional Proofs in Frege and Extended Frege Systems (Abstract) (Q3194704) (← links)
- (Q3304106) (← links)
- The complexity of analytic tableaux (Q3410672) (← links)
- Short Proofs of the Kneser-Lovász Coloring Principle (Q3449464) (← links)
- Introduction to Donaldson–Thomas and Stable Pair Invariants (Q3460695) (← links)
- DEHN FUNCTION AND LENGTH OF PROOFS (Q4464963) (← links)
- (Q4625692) (← links)
- (Q4625701) (← links)
- (Q4625702) (← links)
- (Q4993272) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- An Introduction to Lower Bounds on Resolution Proof Systems (Q5135261) (← links)
- (Q5136303) (← links)
- The Complexity of Finding Read-Once NAE-Resolution Refutations (Q5224491) (← links)
- Short Proofs for the Determinant Identities (Q5252690) (← links)
- The complexity of resolution refinements (Q5444704) (← links)
- LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE (Q5501765) (← links)
- Present and Future of Practical SAT Solving (Q5504707) (← links)
- Hardness Characterisations and Size-width Lower Bounds for QBF Resolution (Q5886517) (← links)
- Proof Complexity of Non-classical Logics (Q5894972) (← links)
- Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution (Q6135750) (← links)
- Classes of hard formulas for QBF resolution (Q6488807) (← links)
