White pebbles help

Authors:
R Wilber
Affiliations:
Carnegie-Mellon University
Venue:
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Year:
1985

Citing 2
Cited 1

A tight bound for black and white pebbles on the pyramid

Journal of the ACM (JACM)
Asymptotically tight bounds on time-space trade-offs in a pebble game

Journal of the ACM (JACM)

On the power of white pebbles

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A family of directed acyclic graphs of vertex indegree 2 is constructed for which there are strategies of the black-white pebble game that use asymptotically fewer pebbles than the best strategies of the black pebble game. This shows that there are straight-line programs that can be evaluated nondeterministically with asymptotically less space than is required by any deterministic evaluation.