The following pages link to (Q5685059):
Displaying 13 items.
- Compact normal forms in propositional logic and integer programming formulations (Q910335) (← links)
- An answer to an open problem of Urquhart (Q1129262) (← links)
- An optimality result for clause form translation (Q1201346) (← links)
- The complexity of Gentzen systems for propositional logic (Q1263584) (← links)
- The splitting of variables and constraints in the formulation of integer programming models (Q1278148) (← links)
- Computational complexity of functions (Q1351510) (← links)
- Resolution lower bounds for the weak functional pigeonhole principle. (Q1401365) (← links)
- Relative efficiency of propositional proof systems: Resolution vs. cut-free LK (Q1577476) (← links)
- What is answer set programming to propositional satisfiability (Q1699519) (← links)
- Resolution lower bounds for perfect matching principles (Q1881260) (← links)
- The complexity of the Hajós calculus for planar graphs (Q2268877) (← links)
- Extended resolution simulates binary decision diagrams (Q2478427) (← links)
- Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds for Superlinear Space (Q2817796) (← links)
