Asymptotically tight bounds on time-space trade-offs in a pebble game
Journal of the ACM (JACM)
Upper and lower bounds on time-space tradeoffs
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Narrow proofs may be spacious: separating space and width in resolution
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Towards an optimal separation of space and length in resolution
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The PSPACE-Completeness of Black-White Pebbling
SIAM Journal on Computing
On the Relative Strength of Pebbling and Resolution
ACM Transactions on Computational Logic (TOCL)
Relating proof complexity measures and practical hardness of SAT
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.01 |
We examine two variations of a one-person pebble game played on directed graphs, which has been studied as a model of register allocation. The black-white pebble game of Cook and Sethi is shown to require as many pebbles in the worst case as the normal pebble game, to within a constant factor. For another version of the pebble game, the problem of deciding whether a given number of pebbles is sufficient for a given graph is shown to be complete in polynomial space.