Yi Zhou, Parikshit Ram, et al.
ICLR 2023
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.
Yi Zhou, Parikshit Ram, et al.
ICLR 2023
Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004