The following pages link to (Q3682461):
Displayed 13 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- The NP-hardness of finding a directed acyclic graph for regular resolution (Q924157) (← links)
- Hilbert's epsilon as an operator of indefinite committed choice (Q946570) (← links)
- A mechanical solution of Schubert's steamroller by many-sorted resolution (Q1060859) (← links)
- Unrestricted resolution versus N-resolution (Q1185013) (← links)
- Width versus size in resolution proofs (Q2382288) (← links)
- Banishing Ultrafilters from Our Consciousness (Q3305324) (← links)
- What Is Essential Unification? (Q3305325) (← links)
- DPLL: The Core of Modern Satisfiability Solvers (Q3305326) (← links)
- A Logical Autobiography (Q5027230) (← links)
- Substitution and Propositional Proof Complexity (Q5027247) (← links)
- In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming (Q5108530) (← links)
- The Mechanical Verification of a DPLL-Based Satisfiability Solver (Q5179007) (← links)