Pages that link to "Item:Q4873893"
From MaRDI portal
The following pages link to The Complexity of Propositional Proofs (Q4873893):
Displaying 22 items.
- A Logical Autobiography (Q5027230) (← links)
- Substitution and Propositional Proof Complexity (Q5027247) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- Satisfiability, Lattices, Temporal Logic and Constraint Logic Programming on Intervals (Q5027249) (← links)
- On an optimal quantified propositional proof system nal proof system and a complete language for NP ∩ co-NP for NP ∩ co-NP (Q5055954) (← links)
- INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH (Q5082067) (← links)
- An Introduction to Lower Bounds on Resolution Proof Systems (Q5135261) (← links)
- Finding the Hardest Formulas for Resolution (Q5154766) (← links)
- Complexity of translations from resolution to sequent calculus (Q5236549) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)
- (Q5457669) (← links)
- (Q5694881) (← links)
- Uniform Proof Complexity (Q5696301) (← links)
- A note on the complexity of propositional Hoare logic (Q5738904) (← links)
- Proofs and Certificates for Max-SAT (Q5870516) (← links)
- MaxSAT Resolution and Subcube Sums (Q5875950) (← links)
- Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity (Q5941296) (← links)
- Complexity of Null- and Positivstellensatz proofs (Q5957910) (← links)
- Non-transitive correspondence analysis (Q6156626) (← links)
- Unit read-once refutations for systems of difference constraints (Q6174656) (← links)
- Clausal proofs for pseudo-Boolean reasoning (Q6535573) (← links)
- Proving the infeasibility of Horn formulas through read-once resolution (Q6558679) (← links)
