{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:51:06Z","timestamp":1725490266809},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749141"},{"type":"electronic","value":"9783540749158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74915-8_39","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T05:13:35Z","timestamp":1187932415000},"page":"527-541","source":"Crossref","is-referenced-by-count":3,"title":["Game Characterizations and the PSPACE-Completeness of Tree Resolution Space"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Hertel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alasdair","family":"Urquhart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"39_CR1","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1137\/S0097539700366735","volume":"31","author":"M. Alekhnovich","year":"2001","unstructured":"Alekhnovich, M., Ben-Sasson, E., Razborov, A.A., Wigderson, A.: Space Complexity in Propositional Calculus. SIAM J. of Comp.\u00a031(4), 1184\u20131211 (2001)","journal-title":"SIAM J. of Comp."},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Atserias, A., Dalmau, V.: A Combinatorial Characterization of Resolution Width. In: Proc. of the 18th IEEE Conference on Computational Complexity (2003)","DOI":"10.1109\/CCC.2003.1214424"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E.: Size Space Tradeoffs For Resolution. In: Proceedings of the 34th ACM Symposium on the Theory of Computing, pp. 457\u2013464 (2002)","DOI":"10.1145\/509907.509975"},{"issue":"4","key":"39_CR4","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s00493-004-0036-5","volume":"24","author":"E. Ben-Sasson","year":"2004","unstructured":"Ben-Sasson, E., Impagliazzo, R., Wigderson, A.: Near Optimal Separation of Tree-like and General Resolution. Combinatorica\u00a024(4), 585\u2013604 (2004)","journal-title":"Combinatorica"},{"key":"39_CR5","volume-title":"Boolean Functions and Computation Models","author":"P. Clote","year":"2001","unstructured":"Clote, P., Kranakis, E.: Boolean Functions and Computation Models. Springer, Heidelberg (2001)"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Cook, S., Sethi, R.: Storage Requirements for Deterministic Polynomial Time Recognizable Languages. J. of Computer & System Sciences, 25\u201337 (1976)","DOI":"10.1016\/S0022-0000(76)80048-7"},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1006\/inco.2001.2921","volume":"171","author":"J. Esteban","year":"2001","unstructured":"Esteban, J., Tor\u00e1n, J.: Space Bounds for Resolution. Information and Computation\u00a0171, 84\u201397 (2001)","journal-title":"Information and Computation"},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0020-0190(03)00345-4","volume":"87","author":"J. Esteban","year":"2003","unstructured":"Esteban, J., Tor\u00e1n, J.: A Combinatorial Characterization of Treelike Resolution Space. Information Processing Letters\u00a087, 295\u2013300 (2003)","journal-title":"Information Processing Letters"},{"issue":"3","key":"39_CR9","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0209038","volume":"9","author":"J.R. Gilbert","year":"1980","unstructured":"Gilbert, J.R., Lengauer, T., Tarjan, R.E.: The Pebbling Problem is Complete in Polynomial Space. SIAM Journal of Computing\u00a09(3), 513\u2013524 (1980)","journal-title":"SIAM Journal of Computing"},{"key":"39_CR10","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1007\/3-540-08860-1_22","volume-title":"Proceedings of the Fifth Colloquium on Automata, Languages and Programming","author":"A. Lingas","year":"1978","unstructured":"Lingas, A.: A PSPACE-Complete Problem Related to a Pebble Game. In: Proceedings of the Fifth Colloquium on Automata, Languages and Programming, London, UK, pp. 300\u2013321. Springer, Heidelberg (1978)"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Nordstr\u00f6m, J.: Narrow Proofs May Be Spacious: Separating Space and Width in Resolution. In: Proc.of the 38th ACM Symposium on the Theory of Computing (2006)","DOI":"10.1145\/1132516.1132590"},{"key":"39_CR12","unstructured":"Pudl\u00e1k, P., Impagliazzo, R.: Lower Bounds for DLL Algorithms for k-SAT. In: Proceedings of SODA 2000 (2000)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74915-8_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:45:55Z","timestamp":1619520355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}