{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T21:37:15Z","timestamp":1768685835402,"version":"3.49.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"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":7929,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,11]]},"DOI":"10.1016\/0890-5401(91)90017-v","type":"journal-article","created":{"date-parts":[[2004,12,2]],"date-time":"2004-12-02T00:24:20Z","timestamp":1101947060000},"page":"96-115","source":"Crossref","is-referenced-by-count":11,"title":["Oracle branching programs and Logspace versus P"],"prefix":"10.1016","volume":"95","author":[{"given":"David A.Mix","family":"Barrington","sequence":"first","affiliation":[]},{"given":"Pierre","family":"McKenzie","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90017-V_BIB1","series-title":"Proceedings of the 20th IEEE Symposium on the Foundations of Computer Science","first-page":"218","article-title":"Random walks, universal traversal sequences, and the complexity of maze problems","author":"Aleliunas","year":"1979"},{"key":"10.1016\/0890-5401(91)90017-V_BIB2","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","article-title":"Bounded-width polynomial-size branching programs recognize exactly those languages in NC1","volume":"38","author":"Barrington","year":"1989","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/0890-5401(91)90017-V_BIB3","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1145\/48014.63138","article-title":"Finite monoids and the fine structure of NC1","volume":"35","author":"Barrington","year":"1988","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90017-V_BIB4","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1137\/0206054","article-title":"On relating time and space to size and depth","volume":"6","author":"Borodin","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/0890-5401(91)90017-V_BIB5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/0211022","article-title":"A time-space tradeoff for sorting on a general sequential model of computation","volume":"11","author":"Borodin","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90017-V_BIB6","series-title":"Proceedings of the 15th ACM Symposium on the Theory of Computing","first-page":"87","article-title":"Bounds for width-two branching programs","author":"Borodin","year":"1983"},{"key":"10.1016\/0890-5401(91)90017-V_BIB7","series-title":"Proceeding of the 20th IEEE Symposium on the Foundations of Computer Science","first-page":"319","article-title":"A time-space tradeoff for sorting on non-oblivious machines","author":"Borodin","year":"1979"},{"key":"10.1016\/0890-5401(91)90017-V_BIB8","series-title":"Proceedings of the 15th ACM Symposium on the Theory of Computing","first-page":"94","article-title":"Multi-party protocols","author":"Chandra","year":"1983"},{"key":"10.1016\/0890-5401(91)90017-V_BIB9","author":"Cobham","year":"1966"},{"key":"10.1016\/0890-5401(91)90017-V_BIB10","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(74)80046-2","article-title":"An observation on time-storage trade-off","volume":"9","author":"Cook","year":"1974","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/0890-5401(91)90017-V_BIB11","first-page":"1","article-title":"Towards a complexity theory of synchronous parallel computation","volume":"27","author":"Cook","year":"1981","journal-title":"Enseign. math."},{"key":"10.1016\/0890-5401(91)90017-V_BIB12","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. Control"},{"key":"10.1016\/0890-5401(91)90017-V_BIB13","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0196-6774(87)90018-6","article-title":"Problems complete for deterministic logarithmic space","volume":"8","author":"Cook","year":"1987","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/0890-5401(91)90017-V_BIB14","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 News"},{"key":"10.1016\/0890-5401(91)90017-V_BIB15","author":"Hopcroft","year":"1974"},{"issue":"5","key":"10.1016\/0890-5401(91)90017-V_BIB16","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","article-title":"Nondeterministic space is closed under complement","volume":"17","author":"Immerman","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90017-V_BIB17","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","article-title":"Space-bounded reducibility among combinatorial problems","volume":"11","author":"Jones","year":"1975","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0890-5401(91)90017-V_BIB18","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","article-title":"Complete problems for deterministic polynomial time","volume":"3","author":"Jones","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90017-V_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01683259","article-title":"New problems complete for nondeterministic log space","volume":"10","author":"Jones","year":"1976","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0890-5401(91)90017-V_BIB20","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0022-0000(88)90027-X","article-title":"The complexity of parallel search","volume":"36","author":"Karp","year":"1988","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0890-5401(91)90017-V_BIB21","series-title":"Proceedings of the 18th ACM Symposium on the Theory of Computing","first-page":"254","article-title":"Lower bounds for natural proof systems","author":"Kozen","year":"1977"},{"issue":"1","key":"10.1016\/0890-5401(91)90017-V_BIB22","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/990518.990519","article-title":"The circuit value problem is log space complete for P","volume":"7","author":"Ladner","year":"1975","journal-title":"SIGACT News"},{"key":"10.1016\/0890-5401(91)90017-V_BIB23","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","article-title":"Representation of switching functions by binary decision programs","volume":"38","author":"Lee","year":"1959","journal-title":"Bell Systems Techn. J."},{"key":"10.1016\/0890-5401(91)90017-V_BIB24","article-title":"A Fast Algorithm for the String Editing Problem and Decision Graph Complexity","author":"Masek","year":"1976"},{"key":"10.1016\/0890-5401(91)90017-V_BIB25","series-title":"Proceedings of the 16th International Colloquium on Automata, Languages and Programming","first-page":"589","article-title":"Automata theory meets circuit complexity","volume":"Vol. 372","author":"McKenzie","year":"1989"},{"key":"10.1016\/0890-5401(91)90017-V_BIB26","series-title":"Proceedings of the 13th ACM Symposium on the Theory of Computing","first-page":"207","article-title":"Bandwith constrained NP-complete problems","author":"Monien","year":"1981"},{"key":"10.1016\/0890-5401(91)90017-V_BIB27","series-title":"Proceedings of the 20th IEEE Symposium on the Foundations of Computer Science","first-page":"307","article-title":"On simultaneous resource bounds","author":"Pippenger","year":"1979"},{"key":"10.1016\/0890-5401(91)90017-V_BIB28","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0890-5401(91)90017-V_BIB29","first-page":"96","article-title":"The method of forcing for nondeterministic automata","author":"Szelepcs\u00e9nyi","year":"1987","journal-title":"Bull. European Assoc. Theoret. Comput. Sci."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190017V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190017V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T18:25:02Z","timestamp":1549045502000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019190017V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["089054019190017V"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90017-v","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,11]]}}}