{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T21:57:27Z","timestamp":1791151047372,"version":"4.1.0"},"reference-count":15,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1980,8]]},"abstract":"<jats:p>In this paper we study a pebbling problem that models the storage requirements of various kinds of computation. Sethi has shown this problem to be $NP$-hard and Lingas has shown a generalization to be P-space complete. We prove the original problem P-space complete by using a modification of Lingas\u2019s proof. The pebbling problem is an example of a P-space complete problem not exhibiting any obvious quantifier alternation.<\/jats:p>","DOI":"10.1137\/0209038","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:21:58Z","timestamp":1109226118000},"page":"513-524","source":"Crossref","is-referenced-by-count":53,"title":["The Pebbling Problem is Complete in Polynomial Space"],"prefix":"10.1137","volume":"9","author":[{"given":"John R.","family":"Gilbert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Lengauer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert Endre","family":"Tarjan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"S. Cook,  An observation on time-storage trade off,  Fifth Annual ACM Symposium on Computing (Austin, Tex., 1973), Assoc. Comput. Mach., New York,  1973,  29\u201333 53:149760305.68066","DOI":"10.1145\/800125.804032"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09118-1_12"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1145\/321978.321989"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"A. S. Fraenkel, M. R. Garey, D. S. Johnson, T. Schaefer, Y. Yesha,  The complexity of checkers on an  N\u00d7N board\u2014preliminary report,  Proc. Nineteenth Annual Symp. on Foundations of Computer Science, Ann Arbor, MI,  1978,  55\u201364","DOI":"10.1109\/SFCS.1978.36"},{"key":"R5","volume-title":"Computers and intractability","author":"Garey Michael R.","year":"1979"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1145\/322003.322015"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.17"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-08860-1_22"},{"key":"R9","unstructured":"M. S. Paterson, C. E. Hewitt,  Comparative schematology,  Record of Project MAC Conference on Concurrent Systems and Parallel Computation, Cambridge, MA,  1970,  119\u2013128"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289150"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1145\/322077.322091"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(70)80006-X"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Thomas J. Schaefer,  Complexity of decision problems based on finite two-person perfect-information games,  Eighth Annual ACM Symposium on Theory of Computing (Hershey, Pa., 1976), Assoc. Comput. Mach., New York,  1976,  41\u201349 56:101350378.68033","DOI":"10.1145\/800113.803629"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1137\/0204020"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"L. J. Stockmeyer, A. R. Meyer,  Word problems requiring exponential time: preliminary report,  Fifth Annual ACM Symposium on Theory of Computing (Austin, Tex., 1973), Assoc. Comput. Mach., New York,  1973,  1\u20139 54:65570359.68050","DOI":"10.1145\/800125.804029"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0209038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:34:41Z","timestamp":1787337281000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0209038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,8]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,8]]}},"alternative-id":["10.1137\/0209038"],"URL":"https:\/\/doi.org\/10.1137\/0209038","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,8]]}}}