{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:51Z","timestamp":1759637631808},"reference-count":25,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0022-0000(03)00037-0","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T01:09:12Z","timestamp":1052788152000},"page":"473-495","source":"Crossref","is-referenced-by-count":2,"title":["Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines"],"prefix":"10.1016","volume":"66","author":[{"given":"Martin","family":"Sauerhoff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00037-0_BIB1","unstructured":"F. Ablayev, Randomization and nondeterminism are incomparable for polynomial ordered binary decision diagrams, in: Proceedings of 24th ICALP, Lecture Notes in Computer Science, Vol. 1256, Bologna, Italy, 1997, pp. 195\u2013202."},{"key":"10.1016\/S0022-0000(03)00037-0_BIB2","doi-asserted-by":"crossref","unstructured":"C. \u00c0lvarez, J. D\u0131\u0301az, J. Tor\u00e1n, Complexity classes with complete problems between P and NP-C, in: Proceedings of 7th FCT, Szeged, Hungary, 1989, pp. 13\u201324.","DOI":"10.1007\/3-540-51498-8_2"},{"key":"10.1016\/S0022-0000(03)00037-0_BIB3","doi-asserted-by":"crossref","unstructured":"L. Babai, P. Frankl, J. Simon, Complexity classes in communication complexity theory, in: Proceedings of 27th FOCS, Toronto, Ontario, Canada, 1986, pp. 337\u2013347.","DOI":"10.1109\/SFCS.1986.15"},{"key":"10.1016\/S0022-0000(03)00037-0_BIB4","doi-asserted-by":"crossref","unstructured":"R. Beigel, J. Goldsmith, Downward separation fails catastrophically for limited nondeterminism classes, in: Proceedings of 9th Conference on Structure in Compl. Theory, Los Alamitos, California, 1994, pp. 134\u2013138.","DOI":"10.1109\/SCT.1994.315810"},{"issue":"8","key":"10.1016\/S0022-0000(03)00037-0_BIB5","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph-based algorithms for Boolean function manipulation","volume":"C-35","author":"Bryant","year":"1986","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/S0022-0000(03)00037-0_BIB6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02090764","article-title":"Classes of bounded nondeterminism","volume":"23","author":"D\u0131\u0301az","year":"1990","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(03)00037-0_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4086\/cjtcs.1997.001","article-title":"On limited versus polynomial nondeterminism","volume":"1","author":"Feige","year":"1997","journal-title":"Chicago J. Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0022-0000(03)00037-0_BIB8","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1137\/0210027","article-title":"Languages simultaneously complete for one-way and two-way log-tape automata","volume":"10","author":"Hartmanis","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00037-0_BIB9","series-title":"Communication Complexity and Parallel Computing. EATCS Texts in Theoretical Computer Science","author":"Hromkovi\u010d","year":"1997"},{"key":"10.1016\/S0022-0000(03)00037-0_BIB10","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, M. Sauerhoff, Tradeoffs between nondeterminism and complexity for communication protocols and branching programs, in: Proceedings of 17th STACS, Lecture Notes in Computer Science, Vol. 1770, Lille, France, 2000, pp. 145\u2013156.","DOI":"10.1007\/3-540-46541-3_12"},{"key":"10.1016\/S0022-0000(03)00037-0_BIB11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0304-3975(88)90166-1","article-title":"Entropy of contact circuits and lower bounds on their complexity","volume":"57","author":"P. Jukna","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(03)00037-0_BIB12","doi-asserted-by":"crossref","unstructured":"C.M.R. Kintala, Computations with a restricted number of nondeterministic steps, Ph.D. Thesis, Pennsylvania State University, University Park, PA, 1977.","DOI":"10.1145\/800105.803407"},{"key":"10.1016\/S0022-0000(03)00037-0_BIB13","doi-asserted-by":"crossref","unstructured":"C.M.R. Kintala, P.C. Fischer, Computations with a restricted number of nondeterministic steps, in: Proceedings of 9th STOC, Boulder, CO, 1977, pp. 178\u2013185.","DOI":"10.1145\/800105.803407"},{"key":"10.1016\/S0022-0000(03)00037-0_BIB14","doi-asserted-by":"crossref","unstructured":"H. Klauck, Lower bounds for computation with limited nondeterminism, in: Proceedings of 13th Conference on Computational Complexity, Buffalo, NY, 1998, pp. 141\u2013152.","DOI":"10.1109\/CCC.1998.694600"},{"issue":"1","key":"10.1016\/S0022-0000(03)00037-0_BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90072-A","article-title":"Lower bounds for depth-restricted branching programs","volume":"91","author":"Krause","year":"1991","journal-title":"Inform. Comput."},{"issue":"1","key":"10.1016\/S0022-0000(03)00037-0_BIB16","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s000370050018","article-title":"On randomized one-round communication complexity","volume":"8","author":"Kremer","year":"1999","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0022-0000(03)00037-0_BIB17","series-title":"Communication Complexity","author":"Kushilevitz","year":"1997"},{"key":"10.1016\/S0022-0000(03)00037-0_BIB18","doi-asserted-by":"crossref","unstructured":"C. Meinel, The power of polynomial size \u03a9-branching programs, in: Proceedings of 5th STACS, Lecture Notes in Computer Science, Vol. 294, Bordeaux, France, 1988, pp. 81\u201390.","DOI":"10.1007\/BFb0035834"},{"issue":"2","key":"10.1016\/S0022-0000(03)00037-0_BIB19","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0020-0190(91)90157-D","article-title":"Private vs. common random bits in communication complexity","volume":"39","author":"Newman","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(03)00037-0_BIB20","unstructured":"I. Niepel, Logarithmisch platzbeschr\u00e4nkte Komplexit\u00e4tsklassen, Master Thesis, Univ. Hamburg, 1987 (in German)."},{"issue":"2","key":"10.1016\/S0022-0000(03)00037-0_BIB21","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1006\/jcss.1996.0058","article-title":"On limited nondeterminism and the complexity of the V-C dimension","volume":"53","author":"Papadimitriou","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(03)00037-0_BIB22","doi-asserted-by":"crossref","unstructured":"A.A. Razborov, Lower bounds for deterministic and nondeterministic branching programs, in Proceedings of 8th FCT, Lecture Notes in Computer Science, Vol. 529, Gosen, Germany, 1991, pp. 47\u201360.","DOI":"10.1007\/3-540-54458-5_49"},{"key":"10.1016\/S0022-0000(03)00037-0_BIB23","unstructured":"M. Sauerhoff, Complexity Theoretical Results for Randomized Branching Programs, Ph.D. Thesis, Univ. Dortmund. Shaker, Aachen, 1999."},{"key":"10.1016\/S0022-0000(03)00037-0_BIB24","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s00037-001-8193-z","article-title":"On the size of randomized OBDDs and read-once branching programs for k-stable functions","volume":"10","author":"Sauerhoff","year":"2001","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0022-0000(03)00037-0_BIB25","series-title":"Branching Programs and Binary Decision Diagrams\u2014Theory and Applications. Monographs on Discrete and Applied Mathematics","author":"Wegener","year":"2000"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000370?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000370?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T21:47:53Z","timestamp":1584654473000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000370"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0022000003000370"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00037-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}