论文信息 - White pebbles help

White pebbles help

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.

Robert E. Wilber

[1] Friedhelm Meyer auf der Heide,et al. A Comparison of two Variations of a Pebble Game on Graphs , 1981, Theor. Comput. Sci..

[2] Robert E. Tarjan,et al. Asymptotically tight bounds on time-space trade-offs in a pebble game , 1982, JACM.

[3] Carl Hewitt,et al. Comparative Schematology , 1970 .

[4] Stephen A. Cook,et al. Storage Requirements for Deterministic Polynomial Time Recognizable Languages , 1976, J. Comput. Syst. Sci..

[5] Maria M. Klawe,et al. A tight bound for black and white pebbles on the pyramid , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[6] Robert E. Tarjan,et al. The Space Complexity of Pebble Games on Trees , 1980, Inf. Process. Lett..

[7] Stephen A. Cook,et al. An Observation on Time-Storage Trade Off , 1974, J. Comput. Syst. Sci..

[8] Harvey M. Friedman,et al. Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory , 1971 .

[9] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[10] Nicholas Pippenger,et al. Advances in Pebbling (Preliminary Version) , 1982, ICALP.