The following pages link to (Q5302095):
Displaying 5 items.
- A simplified way of proving trade-off results for resolution (Q989569) (← links)
- The complexity of the Hajós calculus for planar graphs (Q2268877) (← links)
- Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds for Superlinear Space (Q2817796) (← links)
- On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution (Q3012839) (← links)
- An Introduction to Lower Bounds on Resolution Proof Systems (Q5135261) (← links)
