{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T02:07:22Z","timestamp":1649124442598},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8355,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1016\/0885-064x(90)90023-7","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T14:41:18Z","timestamp":1094654478000},"page":"264-277","source":"Crossref","is-referenced-by-count":0,"title":["The complexity of a simple stochastic OR-tree model in which \u201cdirectional search\u201d is bad"],"prefix":"10.1016","volume":"6","author":[{"given":"Ingo","family":"Alth\u00f6fer","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(90)90023-7_BIB1","series-title":"Proc. Trees and Hierarchical Structures","article-title":"An incremental error correcting algorithm for recursion networks without circuits","author":"Alth\u00f6fer","year":"1987"},{"key":"10.1016\/0885-064X(90)90023-7_BIB2","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1016\/0196-6774(88)90016-8","article-title":"On the complexity of searching game trees and other recursion trees","volume":"9","author":"Alth\u00f6fer","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/0885-064X(90)90023-7_BIB3","series-title":"A parallel game tree search algorithm with a linear speedup","author":"Alth\u00f6fer","year":"1988"},{"issue":"1","key":"10.1016\/0885-064X(90)90023-7_BIB4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0004-3702(79)90003-1","article-title":"The B\u2217 tree search algorithm: A best-first proof procedure","volume":"12","author":"Berliner","year":"1979","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0885-064X(90)90023-7_BIB5","series-title":"Search in Artificial Intelligence","year":"1988"},{"key":"10.1016\/0885-064X(90)90023-7_BIB6","series-title":"Proceedings, 1989 ACM Symposium on Parallel Algorithms and Architectures","first-page":"409","article-title":"On parallel evaluation of game trees","author":"Karp","year":"1989"},{"key":"10.1016\/0885-064X(90)90023-7_BIB7","author":"Knuth","year":"1973"},{"key":"10.1016\/0885-064X(90)90023-7_BIB8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","article-title":"An analysis of alpha-beta pruning","volume":"6","author":"Knuth","year":"1975","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0885-064X(90)90023-7_BIB9","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0004-3702(83)80009-5","article-title":"A general branch-and-bound formulation for understanding and synthesizing AND\/OR tree search procedures","volume":"21","author":"Kumar","year":"1983","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0885-064X(90)90023-7_BIB10","series-title":"Problem-Solving Methods in Artificial Intelligence","author":"Nilsson","year":"1971"},{"key":"10.1016\/0885-064X(90)90023-7_BIB11","series-title":"Heuristics\u2014Intelligent Search Strategies for Computer Problem Solving","author":"Pearl","year":"1984"},{"key":"10.1016\/0885-064X(90)90023-7_BIB12","series-title":"Proc. Advances in Computer Chess 4","first-page":"101","article-title":"Presence and absence of pathology on game trees","author":"Schr\u00fcfer","year":"1986"},{"key":"10.1016\/0885-064X(90)90023-7_BIB13","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1145\/2402.322383","article-title":"Optimal search on some game trees","volume":"30","author":"Tarsi","year":"1983","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X90900237?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X90900237?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T20:57:55Z","timestamp":1549227475000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X90900237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["0885064X90900237"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(90)90023-7","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}