{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:43:17Z","timestamp":1725496997406},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771043"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77105-0_49","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T01:59:37Z","timestamp":1196647177000},"page":"445-456","source":"Crossref","is-referenced-by-count":0,"title":["A PSPACE-complete Sperner Triangle Game"],"prefix":"10.1007","author":[{"given":"Kyle W.","family":"Burke","sequence":"first","affiliation":[]},{"given":"Shang-Hua","family":"Teng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01456931","volume":"71","author":"L. Brouwer","year":"1910","unstructured":"Brouwer, L.: \u00dcber Abbildung von Mannigfaltigkeiten. Mathematische Annalen\u00a071, 97\u2013115 (1910)","journal-title":"Mathematische Annalen"},{"key":"49_CR2","volume-title":"Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"X. Chen","year":"2006","unstructured":"Chen, X., Deng, X.: Settling the complexity of two-player Nash equilibrium. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"49_CR3","volume-title":"Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"X. Chen","year":"2006","unstructured":"Chen, X., Deng, X., Teng, S.-H.: Computing Nash equilibria: Approximation and smoothed complexity. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"49_CR4","volume-title":"Proceedings of the 38th Annual ACM Symposium on Theory of computing (STOC)","author":"C. Daskalakis","year":"2006","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. In: Proceedings of the 38th Annual ACM Symposium on Theory of computing (STOC), IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"49_CR5","unstructured":"Eppstein, D.: Computational complexity of games and puzzles (2006), \n                      \n                         http:\/\/www.ics.uci.edu\/~eppstein\/cgt\/hard.html"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Gale, D.: The game of Hex and the Brouwer fixed-point theorem. American Mathematical Monthly, 818\u2013827 (1979)","DOI":"10.1080\/00029890.1979.11994922"},{"issue":"2","key":"49_CR7","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1145\/322186.322201","volume":"27","author":"D. Lichtenstein","year":"1980","unstructured":"Lichtenstein, D., Sipser, M.: Go is polynomial-space hard. J. ACM\u00a027(2), 393\u2013401 (1980)","journal-title":"J. ACM"},{"key":"49_CR8","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison Wesley, Reading, Massachsetts (1994)"},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences, 498\u2013532 (1994)","DOI":"10.1016\/S0022-0000(05)80063-7"},{"key":"49_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00288964","volume":"15","author":"S. Reisch","year":"1981","unstructured":"Reisch, S.: Hex ist PSPACE-vollst\u00e4ndig. Acta Inf.\u00a015, 167\u2013191 (1981)","journal-title":"Acta Inf."},{"key":"49_CR11","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02940617","volume":"6","author":"E. Sperner","year":"1928","unstructured":"Sperner, E.: Neuer Beweis f\u00fcr die Invarianz der Dimensionszahl und des Gebietes. Abhandlungen aus dem Mathematischen Seminar Universitat Hamburg\u00a06, 265\u2013272 (1928)","journal-title":"Abhandlungen aus dem Mathematischen Seminar Universitat Hamburg"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77105-0_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:00:33Z","timestamp":1619506833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77105-0_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771043"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77105-0_49","relation":{},"subject":[]}}