Pages that link to "Item:Q2848360"
From MaRDI portal
The following pages link to Pebble games, proof complexity, and time-space trade-offs (Q2848360):
Displaying 27 items.
- On space and depth in resolution (Q1616620) (← links)
- A note about \(k\)-DNF resolution (Q1641156) (← links)
- Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
- On semantic cutting planes with very small coefficients (Q1751424) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (Q2074664) (← links)
- Generalising unit-refutation completeness and SLUR via nested input resolution (Q2352484) (← links)
- Pebble games and subroutines in least fixed point logic (Q2508327) (← links)
- Time-space trade-offs in resolution: superpolynomial lower bounds for superlinear space (Q2817796) (← links)
- Total space in resolution (Q2829448) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- The PSPACE-Completeness of Black-White Pebbling (Q3068646) (← links)
- Towards an optimal separation of space and length in resolution (Q3191584) (← links)
- The relation between polynomial calculus, Sherali-Adams, and sum-of-squares proofs (Q3304105) (← links)
- A New Pebble Game that Characterizes Parallel Complexity Classes (Q3835026) (← links)
- (Q4362728) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- Cumulative Space in Black-White Pebbling and Resolution (Q4638091) (← links)
- Time and space complexity of reversible pebbling (Q4825392) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)
- On CDCL-Based Proof Systems with the Ordered Decision Strategy (Q5097511) (← links)
- An Introduction to Lower Bounds on Resolution Proof Systems (Q5135261) (← links)
- Supercritical Space-Width Trade-offs for Resolution (Q5215515) (← links)
- Token Swapping on Trees (Q6045462) (← links)
- Propositional proof complexity (Q6064569) (← links)
- Space characterizations of complexity measures and size-space trade-offs in propositional proof systems (Q6168323) (← links)
