论文信息 - Pebbling with an Auxiliary Pushdown

Pebbling with an Auxiliary Pushdown

Abstract A pebble game on graphs is introduced which bears the same relationship to the ordinary pebble game as auxiliary pushdown machines bear to ordinary machines. The worst-case time-space trade-off for pebbling with an auxiliary pushdown is shown to be T = N exp e( N S ) (where T denotes time, S denotes space and N denotes the size of the graph), which contrasts with T = N exp exp e( N S ) for ordinary pebbling. The significance of this result to various questions concerning relations among complexity classes is discussed.

Nicholas Pippenger

[1] Stephen A. Cook,et al. Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.

[2] Robert E. Tarjan,et al. Space bounds for a game on graphs , 1976, STOC '76.

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

[4] Walter L. Ruzzo,et al. On uniform circuit complexity , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[5] Nicholas Pippenger. Comparative Schematology and Pebbling with Auxiliary Pushdowns , 1980 .

[6] Zvi Galil,et al. Explicit constructions of linear size superconcentrators , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[7] Walter L. Ruzzo,et al. Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..

[8] Stephen A. Cook,et al. Deterministic CFL's are accepted simultaneously in polynomial time and log squared space , 1979, STOC.

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

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

[11] R. Ladner. The circuit value problem is log space complete for P , 1975, SIGA.

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