{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T06:14:05Z","timestamp":1648534445415},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"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":4368,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,8]]},"DOI":"10.1016\/s0304-3975(00)00216-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:37:19Z","timestamp":1027600639000},"page":"127-137","source":"Crossref","is-referenced-by-count":0,"title":["On BPP versus NP\u222acoNP for ordered read-once branching programs"],"prefix":"10.1016","volume":"264","author":[{"given":"Farid","family":"Ablayev","sequence":"first","affiliation":[]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[]},{"given":"Rustam","family":"Mubarakzjanov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00216-4_BIB1","doi-asserted-by":"crossref","unstructured":"F. Ablayev, Randomization and Nondeterminism are Incomparable for ordered read-once branching programs, Proc. ICALP\u201997, Lecture Notes in Computer Science, Vol. 1256, Springer, Berlin, 1997, pp. 195\u2013202; ECCC TR97-021, 1997, available at http:\/\/www.eccc.uni-trier.de\/eccc\/.","DOI":"10.1007\/3-540-63165-8_177"},{"key":"10.1016\/S0304-3975(00)00216-4_BIB2","first-page":"348","volume":"Vol. 1099","author":"Ablayev","year":"1996"},{"key":"10.1016\/S0304-3975(00)00216-4_BIB3","unstructured":"F. Ablayev, M. Karpinski, On the power of randomized ordered branching programs, ECCC TR98-004, 1998, available at http:\/\/www.eccc.uni-trier.de\/eccc\/."},{"key":"10.1016\/S0304-3975(00)00216-4_BIB4","unstructured":"F. Ablayev, M. Karpinski, A lower bound for integer multiplication on randomized read-once branching programs, ECCC TR98-011, 1998, available at http:\/\/www.eccc.uni-trier.de\/eccc\/."},{"key":"10.1016\/S0304-3975(00)00216-4_BIB5","unstructured":"F. Ablayev, M. Karpinski, R. Mubarakzjanov, On BPP versus NP\u222a coNP for ordered read-once branching programs, Proc. Randomized Algorithms 1998, Bruno, 1998."},{"key":"10.1016\/S0304-3975(00)00216-4_BIB6","doi-asserted-by":"crossref","unstructured":"R. Boppana, M. Sipser, The Complexity of Finite Functions, in Handbook of Theoretical Computer Science, J. Van Leeuwen (Ed.), Vol A. Algorithms and Complexity, MIT Press and Elsevier, The Netherlands, 1990, pp. 757\u2013804.","DOI":"10.1016\/B978-0-444-88071-0.50019-9"},{"key":"10.1016\/S0304-3975(00)00216-4_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01200404","article-title":"On lower bounds for read-k-times branching programs","volume":"3","author":"Borodin","year":"1993","journal-title":"Comput. Complexity"},{"issue":"3","key":"10.1016\/S0304-3975(00)00216-4_BIB8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/136035.136043","article-title":"Symbolic boolean minipulation with ordered binary decision diagrams","volume":"24","author":"Bryant","year":"1992","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0304-3975(00)00216-4_BIB9","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1112\/blms\/26.2.140","article-title":"Cyclic spaces for Grassmann derivatives and additive theory","volume":"26","author":"Dias da Silva","year":"1994","journal-title":"Bull. London Math. Soc."},{"key":"10.1016\/S0304-3975(00)00216-4_BIB10","doi-asserted-by":"crossref","unstructured":"S. Jukna, On the effect of null-chains on the complexity of contact schemes, Proc. of FCT, Lecture Notes in Computer Science, Vol. 380, 1989, pp. 246\u2013256.","DOI":"10.1007\/3-540-51498-8_24"},{"key":"10.1016\/S0304-3975(00)00216-4_BIB11","doi-asserted-by":"crossref","unstructured":"S. Jukna, A. Razborov, P. Savicky, I. Wegener, On P versus NP \u2229 co\u2212NP for decision trees and read-once branching programs, ECCC TR97-023, 1997, available at http:\/\/www.ecc.uni-trier.de\/eccc\/.","DOI":"10.1007\/BFb0029975"},{"key":"10.1016\/S0304-3975(00)00216-4_BIB12","unstructured":"M. Karpinski, On the computational power of randomized branching programs, Proc. Randomized Algorithms 1998, Bruno, 1998."},{"key":"10.1016\/S0304-3975(00)00216-4_BIB13","unstructured":"M. Karpinski, R. Mubarakzjanov, Some separation problems on randomized OBDDs, University of Bonn, 85196-CS, 1998 available http:\/\/cs.uni-bonn.de\/info5\/publications\/cs-1998-ln.html."},{"key":"10.1016\/S0304-3975(00)00216-4_BIB14","doi-asserted-by":"crossref","unstructured":"M. Krause, C. Meinel, S. Waack, Separating the eraser turing machine classes Le, NLe, co\u2212NLe and Pe, Proc. of MFCS, Lecture Notes in Computer Science, Vol. 324, pp. 405\u2013413.","DOI":"10.1007\/BFb0017163"},{"key":"10.1016\/S0304-3975(00)00216-4_BIB15","unstructured":"W. Masek, A fast algorithm for the string editing problem and decision graph complexity, M.Sc. Thesis, Massachusetts Institute of Technology, Cambridge, May 1976."},{"key":"10.1016\/S0304-3975(00)00216-4_BIB16","doi-asserted-by":"crossref","unstructured":"S. Ponzio, A lower bound for integer multiplication with read-once branching programs, Proc. 27th ACM STOC, 1995, pp. 130\u2013139.","DOI":"10.1145\/225058.225098"},{"key":"10.1016\/S0304-3975(00)00216-4_BIB17","doi-asserted-by":"crossref","unstructured":"A. Razborov, Lower bounds for deterministic and nondeterministic branching programs, Proc. FCT\u201991, Lecture Notes in Computer Science, Vol. 529, Springer, Berlin, 1991, pp. 47\u201360.","DOI":"10.1007\/3-540-54458-5_49"},{"key":"10.1016\/S0304-3975(00)00216-4_BIB18","unstructured":"M. Sauerhoff, A lower bound for randomized read-k-times branching programs, ECCC, TR97-019, 1997, available at http:\/\/www.eccc.uni-trier.de\/eccc\/."},{"key":"10.1016\/S0304-3975(00)00216-4_BIB19","unstructured":"P. Savicky, S. Zak, A large lower bound for 1-branching programs, ECCC, Revision 01 of TR96-036, 1996, available at http:\/\/www.eccc.uni-trier.de\/eccc\/."},{"key":"10.1016\/S0304-3975(00)00216-4_BIB20","unstructured":"P. Savicky, S. Zak, A hierarchy for (1,+k)-branching programs with respect to k, ECCC, TR96-050, 1996, available at http:\/\/www.eccc.uni-trier.de\/eccc\/."},{"key":"10.1016\/S0304-3975(00)00216-4_BIB21","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0012-365X(95)90790-R","article-title":"Efficient data structures for boolean functions","volume":"136","author":"Wegener","year":"1994","journal-title":"Discrete Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002164?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002164?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T15:25:59Z","timestamp":1578756359000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S0304397500002164"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00216-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}