A. Skumanich
SPIE OE/LASE 1992
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.
A. Skumanich
SPIE OE/LASE 1992
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.