论文信息 - Pebbling and Bandwith

Pebbling and Bandwith

It is shown that a graph with n vertices and bandwidth k requires at most min(2k2+k+1,2klogn) pebbles. Furthermore, the pebble problem restricted to and/or graphs of bandwidth f(n) is in INSPACE( f(n)×log2n) and is log space hard for the class INTISP(poly,f(n)). ( INTISP(poly,f(n)) denotes the class of sets accepted by nondeterministic Turing machines in polynomial time and simultaneous f(n) space. )

Ivan Hal Sudborough

[1] Ivan Hal Sudborough,et al. On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space , 1979, ICALP.

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

[3] Jan van Leeuwen,et al. Move Rules and Trade-Offs in the Pebble Game , 1979, Theoretical Computer Science.

[4] Andrzej Lingas. A PSPACE Complete Problem Related to a Pebble Game , 1978, ICALP.

[5] Ivan Hal Sudborough,et al. Bandwidth constrained NP-Complete problems , 1981, STOC '81.

[6] Robert E. Tarjan,et al. The Pebbling Problem is Complete in Polynomial Space , 1980, SIAM J. Comput..

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

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

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

[10] Ravi Sethi. Complete Register Allocation Problems , 1975, SIAM J. Comput..

[11] Ivan Hal Sudborough,et al. Efficient algorithms for path system problems and applications to alternating and time-space complexity classes , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[12] Leslie G. Valiant,et al. On Time Versus Space , 1977, JACM.

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