The following pages link to (Q4152212):
Displayed 28 items.
- Semantics and proof-theory of depth bounded Boolean logics (Q385021) (← links)
- Logical omniscience as infeasibility (Q392271) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Extended clause learning (Q622116) (← links)
- Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
- The intractability of resolution (Q1071750) (← links)
- An answer to an open problem of Urquhart (Q1129262) (← links)
- Tautology testing with a generalized matrix reduction method (Q1132862) (← links)
- On the complexity of regular resolution and the Davis-Putnam procedure (Q1249435) (← links)
- The complexity of Gentzen systems for propositional logic (Q1263584) (← links)
- On the relative merits of path dissolution and the method of analytic tableaux (Q1331929) (← links)
- Controlled integration of the cut rule into connection tableau calculi (Q1344875) (← links)
- A proper hierarchy of propositional sequent calculi (Q1350509) (← links)
- Davis-Putnam resolution versus unrestricted resolution (Q1353991) (← links)
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← links)
- Optimal proof systems imply complete sets for promise classes (Q1398371) (← links)
- Resolution and binary decision diagrams cannot simulate each other polynomially (Q1408378) (← links)
- The proof complexity of analytic and clausal tableaux (Q1575658) (← links)
- Relative efficiency of propositional proof systems: Resolution vs. cut-free LK (Q1577476) (← links)
- Some remarks on lengths of propositional proofs (Q1908815) (← links)
- Resolution remains hard under equivalence (Q1961451) (← links)
- On a generalization of extended resolution (Q1961452) (← links)
- On the complexity of choosing the branching literal in DPLL (Q1978252) (← links)
- Making knowledge explicit: how hard it is (Q2500480) (← links)
- Frege systems for extensible modal logics (Q2503409) (← links)
- Satisfiability problems for propositional calculi (Q3864500) (← links)
- A note on some computationally difficult set covering problems (Q3867546) (← links)
- Proof Complexity of Non-classical Logics (Q5894972) (← links)