{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:46:27Z","timestamp":1760078787475},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"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":8294,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,11]]},"DOI":"10.1016\/0166-218x(90)90080-v","type":"journal-article","created":{"date-parts":[[2002,7,28]],"date-time":"2002-07-28T20:40:59Z","timestamp":1027888859000},"page":"21-33","source":"Crossref","is-referenced-by-count":7,"title":["The complexity of short two-person games"],"prefix":"10.1016","volume":"29","author":[{"given":"Ashok K.","family":"Chandra","sequence":"first","affiliation":[]},{"given":"Martin","family":"Tompa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90080-V_BIB1","article-title":"Games in general","volume":"Vol. 1","author":"Berlekamp","year":"1982"},{"key":"10.1016\/0166-218X(90)90080-V_BIB2","article-title":"Games in particular","volume":"Vol. 2","author":"Berlekamp","year":"1982"},{"issue":"1","key":"10.1016\/0166-218X(90)90080-V_BIB3","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"issue":"1\u20133","key":"10.1016\/0166-218X(90)90080-V_BIB4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"issue":"2","key":"10.1016\/0166-218X(90)90080-V_BIB5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0022-0000(85)90011-X","article-title":"Speedups of deterministic machines by synchronous parallel machines","volume":"30","author":"Dymond","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(90)90080-V_BIB6","series-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"2","key":"10.1016\/0166-218X(90)90080-V_BIB7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1008354.1008356","article-title":"The monotone and planar circuit value problems are log space complete for P","volume":"9","author":"Goldschlager","year":"1977","journal-title":"SIGACT New"},{"issue":"2","key":"10.1016\/0166-218X(90)90080-V_BIB8","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(80)90036-7","article-title":"Tree-size bounded alternation","volume":"21","author":"Ruzzo","year":"1980","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/0166-218X(90)90080-V_BIB9","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuit complexity","volume":"22","author":"Ruzzo","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(90)90080-V_BIB10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","article-title":"On the complexity of some two-person perfect-information games","volume":"16","author":"Schaefer","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(90)90080-V_BIB11","article-title":"Ten Lectures on the Probabilistic Method","volume":"52","author":"Spencer","year":"1987"},{"issue":"2","key":"10.1016\/0166-218X(90)90080-V_BIB12","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0213027","article-title":"Simulation of parallel random access machines by circuits","volume":"13","author":"Stockmeyer","year":"1984","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0166-218X(90)90080-V_BIB13","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/322077.322083","article-title":"On the tape complexity of deterministic context-free languages","volume":"25","author":"Sudborough","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(90)90080-V_BIB14","series-title":"Computational Aspects of VLSI","author":"Ullman","year":"1984"},{"key":"10.1016\/0166-218X(90)90080-V_BIB15","first-page":"141","article-title":"Properties that characterize LOGCFL","author":"Venkateswaran","year":"1987","journal-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing"},{"issue":"3","key":"10.1016\/0166-218X(90)90080-V_BIB16","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1137\/0218036","article-title":"A new pebble game that characterizes parallel complexity classes","volume":"18","author":"Venkateswaran","year":"1989","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090080V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090080V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T07:23:46Z","timestamp":1554967426000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090080V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["0166218X9090080V"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90080-v","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}