Pages that link to "Item:Q3581425"
From MaRDI portal
The following pages link to Lower bounds for k-DNF resolution on random 3-CNFs (Q3581425):
Displaying 5 items.
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
- The complexity of the Hajós calculus for planar graphs (Q2268877) (← links)
- On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution (Q3012839) (← links)
- Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793) (← links)
