Pages that link to "Item:Q4873893"
From MaRDI portal
The following pages link to The Complexity of Propositional Proofs (Q4873893):
Displaying 50 items.
- Interpolation systems for ground proofs in automated deduction: a survey (Q287275) (← links)
- On the elimination of quantifier-free cuts (Q650922) (← links)
- Two party immediate response disputes: Properties and efficiency (Q814510) (← links)
- Proof complexity of modal resolution (Q832717) (← links)
- On meta complexity of propositional formulas and propositional proofs (Q937212) (← links)
- Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949) (← links)
- An answer to an open problem of Urquhart (Q1129262) (← links)
- The complexity of Gentzen systems for propositional logic (Q1263584) (← links)
- On the modelling of search in theorem proving -- towards a theory of strategy analysis (Q1281504) (← links)
- Optimal proof systems imply complete sets for promise classes (Q1398371) (← links)
- Resolution and binary decision diagrams cannot simulate each other polynomially (Q1408378) (← links)
- Homomorphisms of conjunctive normal forms. (Q1408387) (← links)
- The proof complexity of analytic and clausal tableaux (Q1575658) (← links)
- EXPtime tableaux for ALC (Q1589576) (← links)
- Finding read-once resolution refutations in systems of 2CNF clauses (Q1749535) (← links)
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
- The proof complexity of linear algebra (Q1886325) (← links)
- Resolution remains hard under equivalence (Q1961451) (← links)
- On a generalization of extended resolution (Q1961452) (← links)
- The symmetry rule in propositional logic (Q1961453) (← links)
- The treewidth of proofs (Q2013559) (← links)
- Analyzing unit read-once refutations in difference constraint systems (Q2055789) (← links)
- Non-clausal redundancy properties (Q2055860) (← links)
- A proof builder for Max-SAT (Q2118341) (← links)
- Simulating strong practical proof systems with extended resolution (Q2209554) (← links)
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (Q2235285) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- Partially definable forcing and bounded arithmetic (Q2257103) (← links)
- The complexity of the Hajós calculus for planar graphs (Q2268877) (← links)
- The universe of propositional approximations (Q2369011) (← links)
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints (Q2415363) (← 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)
- Minimum propositional proof length is NP-hard to linearly approximate (Q2732273) (← links)
- Expressing versus proving: relating forms of complexity in logic (Q2882560) (← links)
- On the complexity of proof deskolemization (Q2892685) (← links)
- Complexity of propositional proofs under a promise (Q2946606) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- Proof Complexity and the Kneser-Lovász Theorem (Q3192060) (← links)
- NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability (Q3386749) (← links)
- Regular and General Resolution: An Improved Separation (Q3502715) (← links)
- Twelve Problems in Proof Complexity (Q3503621) (← links)
- Limitations of Restricted Branching in Clause Learning (Q3523067) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- (Q4263835) (← links)
- Simulation of Natural Deduction and Gentzen Sequent Calculus (Q4683217) (← links)
- (Q4729773) (← links)
- (Q4790380) (← links)
- Towards Hilbert's 24th Problem: Combinatorial Proof Invariants (Q4917988) (← links)
- On Exponential Lower Bounds for Partially Ordered Resolution (Q5015597) (← links)
