{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:59:29Z","timestamp":1725893969455},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735557"},{"type":"electronic","value":"9783540735564"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73556-4_34","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T15:55:47Z","timestamp":1188316547000},"page":"323-334","source":"Crossref","is-referenced-by-count":4,"title":["The Computational Complexity of Game Trees by Eigen-Distribution"],"prefix":"10.1007","author":[{"given":"ChenGuang","family":"Liu","sequence":"first","affiliation":[]},{"given":"Kazuyuki","family":"Tanaka","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Blum, M., Impagliazzo, R.: Generic Oracles and Oracle Classed. In: Proceedings of the 28th Annual Symposium on Foundations of Computer science(FOCS), pp. 118\u2013126 (1987)","DOI":"10.1109\/SFCS.1987.30"},{"issue":"1-3","key":"34_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(88)90022-9","volume":"58","author":"J. Hartmanis","year":"1988","unstructured":"Hartmanis, J., Hemachandra, L.A.: Complexity classes without machines: on complete languages for UP. Theoretical Computer Science\u00a058(1-3), 129\u2013142 (1988)","journal-title":"Theoretical Computer Science"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"D.E. Knuth","year":"1975","unstructured":"Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artificial Intelligence.\u00a06, 293\u2013326 (1975)","journal-title":"Artificial Intelligence."},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Liu, C.G., Tanaka, K.: The Complexity of Algorithms Computing Game Trees on Random Assignments. In: Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management, Portland,OR, USA, June, 2007. LNCS, vol.\u00a04508, pp. 241\u2013250 (2007)","DOI":"10.1007\/978-3-540-72870-2_23"},{"key":"34_CR5","first-page":"29","volume-title":"Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer science(FOCS)","author":"M. Saks","year":"1986","unstructured":"Saks, M., Wigderson, A.: Probabilistic Boolean Decision Trees and the Complexity of Evaluating Game Trees. In: Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer science(FOCS), pp. 29\u201338. IEEE Computer Society Press, Los Alamitos (1986)"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02125350","volume":"9","author":"G. Tardos","year":"1990","unstructured":"Tardos, G.: Query complexity, or why is it difficult to separate NP A \u2009\u2229\u2009coNP A from P A by random oracles A. Combinatorica\u00a09, 385\u2013392 (1990)","journal-title":"Combinatorica"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01448847","volume":"100","author":"J. Neumann von","year":"1928","unstructured":"von Neumann, J.: Zur Theorie der Gesellschaftsspiele. Mathematische Annalen\u00a0100, 295\u2013320 (1928)","journal-title":"Mathematische Annalen"},{"key":"34_CR8","first-page":"222","volume-title":"Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer science(FOCS)","author":"A.C.-C. Yao","year":"1977","unstructured":"Yao, A.C.-C.: Probabilistic Computations: Towards a Unified Measure of Complexity. In: Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer science(FOCS), pp. 222\u2013227. IEEE Computer Society Press, Los Alamitos (1977)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73556-4_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:51:44Z","timestamp":1619517104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73556-4_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735557","9783540735564"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73556-4_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}