{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,28]],"date-time":"2026-09-28T16:15:02Z","timestamp":1790612102285,"version":"4.1.0"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2013,9,13]],"date-time":"2013-09-13T00:00:00Z","timestamp":1379030400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["279611"],"award-info":[{"award-number":["279611"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Pebble games were extensively studied in the 1970s and 1980s in a number of\ndifferent contexts. The last decade has seen a revival of interest in pebble\ngames coming from the field of proof complexity. Pebbling has proven to be a\nuseful tool for studying resolution-based proof systems when comparing the\nstrength of different subsystems, showing bounds on proof space, and\nestablishing size-space trade-offs. This is a survey of research in proof\ncomplexity drawing on results and tools from pebbling, with a focus on proof\nspace lower bounds and trade-offs between proof size and proof space.<\/jats:p>","DOI":"10.2168\/lmcs-9(3:15)2013","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T13:44:29Z","timestamp":1385732669000},"source":"Crossref","is-referenced-by-count":32,"title":["Pebble Games, Proof Complexity, and Time-Space Trade-offs"],"prefix":"10.46298","volume":"Volume 9, Issue 3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2700-4285","authenticated-orcid":false,"given":"Jakob","family":"Nordstrom","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"25203","published-online":{"date-parts":[[2013,9,13]]},"reference":[{"key":"470:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1111\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1111\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:03:46Z","timestamp":1681243426000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,13]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-9(3:15)2013","relation":{"is-same-as":[{"id-type":"arxiv","id":"1307.3913","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1307.3913","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"arxiv","id":"1311.2355","asserted-by":"subject"},{"id-type":"doi","id":"10.1137\/16m1082007","asserted-by":"subject"},{"id-type":"doi","id":"10.1145\/2591796.2591838","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,13]]},"article-number":"1111"}}