Pages that link to "Item:Q1249435"
From MaRDI portal
The following pages link to On the complexity of regular resolution and the Davis-Putnam procedure (Q1249435):
Displayed 31 items.
- Meta-resolution: An algorithmic formalisation (Q671650) (← links)
- Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (Q764375) (← links)
- The NP-hardness of finding a directed acyclic graph for regular resolution (Q924157) (← links)
- The intractability of resolution (Q1071750) (← links)
- A satisfiability tester for non-clausal propositional calculus (Q1111774) (← links)
- Probabilistic performance of a heurisic for the satisfiability problem (Q1115189) (← links)
- Optimizing propositional calculus formulas with regard to questions of deducibility (Q1117918) (← links)
- A note on regular resolution (Q1137994) (← links)
- A simplified proof that regular resolution is exponential (Q1141648) (← links)
- Unrestricted resolution versus N-resolution (Q1185013) (← links)
- Tseitin's formulas revisited (Q1193906) (← links)
- The complexity of Gentzen systems for propositional logic (Q1263584) (← links)
- A lower bound for tree resolution (Q1336637) (← links)
- Problem solving by searching for models with a theorem prover (Q1337680) (← links)
- The relative complexity of resolution and cut-free Gentzen systems (Q1353988) (← links)
- Davis-Putnam resolution versus unrestricted resolution (Q1353991) (← links)
- An average case analysis of a resolution principle algorithm in mechanical theorem proving. (Q1353997) (← links)
- Resolution deduction to detect satisfiability for another class including non-Horn sentences in propositional logic (Q1819946) (← links)
- A comparative study of several proof procedures (Q1836483) (← links)
- The \(Multi\)-SAT algorithm (Q1961449) (← links)
- The symmetry rule in propositional logic (Q1961453) (← links)
- Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs (Q1983330) (← links)
- The complexity of the Hajós calculus for planar graphs (Q2268877) (← links)
- Width versus size in resolution proofs (Q2382288) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- Hard satisfiable instances for DPLL-type algorithms (Q2577593) (← links)
- Generating hard satisfiability problems (Q2674174) (← links)
- A bound on the length of a random derivation-search tree in general multi-premise calculi (Q4007369) (← links)
- On Exponential Lower Bounds for Partially Ordered Resolution (Q5015597) (← links)
- A Logical Autobiography (Q5027230) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)