Pages that link to "Item:Q5444711"
From MaRDI portal
The following pages link to The Complexity of Propositional Proofs (Q5444711):
Displaying 50 items.
- Proof complexity and textual cohesion (Q302177) (← links)
- 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)
- Combinatorics of first order structures and propositional proof systems (Q701740) (← 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)
- On meta complexity of propositional formulas and propositional proofs (Q937212) (← links)
- The complexity of Gentzen systems for propositional logic (Q1263584) (← links)
- Simplified lower bounds for propositional proofs (Q1374208) (← 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)
- On the automatizability of resolution and related propositional proof systems (Q1881219) (← 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)
- The universe of propositional approximations (Q2369011) (← links)
- A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
- Upper bounds on complexity of Frege proofs with limited use of certain schemata (Q2491079) (← links)
- On the complexity of the reflected logic of proofs (Q2500485) (← 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)
- Expressing versus proving: relating forms of complexity in logic (Q2882560) (← links)
- On the complexity of proof deskolemization (Q2892685) (← links)
- On extracting computations from propositional proofs (a survey) (Q2908835) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- Complexity of propositional proofs under a promise (Q2946606) (← links)
- On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas (Q2988835) (← links)
- Proof Complexity and the Kneser-Lovász Theorem (Q3192060) (← 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)
- Twelve Problems in Proof Complexity (Q3503621) (← links)
- (Q4263835) (← links)
- DEHN FUNCTION AND LENGTH OF PROOFS (Q4464963) (← links)
- (Q4625692) (← links)
