Similar Items: Lower Bounds for Existential Pebble Games and k-Consistency Tests
- Consistency of circuit lower bounds with bounded theories
- On the consistency of stronger lower bounds for NEXP
- Pebble Games and Algebraic Proof Systems
- Pebble Games and Algebraic Proof Systems
- Pebble Games, Proof Complexity, and Time-Space Trade-offs
- From Gödel incompleteness to the consistency of circuit lower bounds