{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T10:14:31Z","timestamp":1722939271680},"publisher-location":"New York, New York, USA","reference-count":0,"publisher":"ACM Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1979]]},"DOI":"10.1145\/800135.804418","type":"proceedings-article","created":{"date-parts":[[2003,11,25]],"date-time":"2003-11-25T11:40:52Z","timestamp":1069760452000},"page":"237-248","source":"Crossref","is-referenced-by-count":9,"title":["The pebbling problem is complete in polynomial space"],"prefix":"10.1145","author":[{"given":"John R.","family":"Gilbert","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Lengauer","sequence":"additional","affiliation":[]},{"given":"Robert Endre","family":"Tarjan","sequence":"additional","affiliation":[]}],"member":"320","event":{"sponsor":["ACM, Association for Computing Machinery","SIGACT, ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC '79","name":"the eleventh annual ACM symposium","start":{"date-parts":[[1979,4,30]]},"location":"Atlanta, Georgia, United States","end":{"date-parts":[[1979,5,2]]}},"container-title":["Proceedings of the eleventh annual ACM symposium on Theory of computing - STOC '79"],"original-title":[],"link":[{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=804418&ftid=53616&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,15]],"date-time":"2016-12-15T22:36:16Z","timestamp":1481841376000},"score":1,"resource":{"primary":{"URL":"http:\/\/portal.acm.org\/citation.cfm?doid=800135.804418"}},"subtitle":[],"proceedings-subject":"Theory of computing","short-title":[],"issued":{"date-parts":[[1979]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1145\/800135.804418","relation":{},"subject":[],"published":{"date-parts":[[1979]]}}}