Classes of Pebble Games and Complete Problems
- 1 November 1979
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 8 (4), 574-586
- https://doi.org/10.1137/0208046
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- On Time Versus SpaceJournal of the ACM, 1977
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976
- A Combinatorial Problem Which Is Complete in Polynomial SpaceJournal of the ACM, 1976
- Storage requirements for deterministic polynomialtime recognizable languagesJournal of Computer and System Sciences, 1976
- An observation on time-storage trade offJournal of Computer and System Sciences, 1974
- Reducibility among Combinatorial ProblemsPublished by Springer Science and Business Media LLC ,1972
- Parallel program schemataJournal of Computer and System Sciences, 1969