Martin C. Gutzwiller
Physica D: Nonlinear Phenomena
It is proved that for infinitely many n there is a directed acyclic graph with vertex indegrees bounded by 2 that has a strategy of the black-white pebble game using n pebbles and for which any strategy of the black pebble game requires Ω(n log n/log log n) pebbles. This shows that there is a family of straight-line programs for which nondeterminism reduces the space required to evaluate the programs by more than any constant factor. © 1988.
Martin C. Gutzwiller
Physica D: Nonlinear Phenomena
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
D.S. Turaga, K. Ratakonda, et al.
SCC 2006
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI