{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T10:29:44Z","timestamp":1672568984721},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,7,1]],"date-time":"1998-07-01T00:00:00Z","timestamp":899251200000},"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":5495,"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":[[1998,7]]},"DOI":"10.1016\/s0166-218x(98)00042-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"223-238","source":"Crossref","is-referenced-by-count":16,"title":["Neither reading few bits twice nor reading illegally helps much"],"prefix":"10.1016","volume":"85","author":[{"given":"S.","family":"Jukna","sequence":"first","affiliation":[]},{"given":"A.","family":"Razborov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00042-0_BIB1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0022-0000(87)90010-9","article-title":"A lower bound for read-once-only branching programs","volume":"35","author":"Babai","year":"1987","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(98)00042-0_BIB2","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"},{"key":"10.1016\/S0166-218X(98)00042-0_BIB3","series-title":"Proc. FCT'85","first-page":"90","article-title":"Lower bounds on the complexity of one-time-only branching programs","volume":"vol. 199","author":"Dunne","year":"1985"},{"key":"10.1016\/S0166-218X(98)00042-0_BIB4_1","series-title":"Proc. MFCS'86","first-page":"440","article-title":"Lower bounds on the complexity of local circuits","volume":"vol. 233","author":"Jukna","year":"1986"},{"key":"10.1016\/S0166-218X(98)00042-0_BIB4_2","first-page":"113","article-title":"Journal version: S. Jukna, Entropy of contact circuits and lower bounds on their complexity","volume":"57","author":"Jukna","year":"1988"},{"issue":"1","key":"10.1016\/S0166-218X(98)00042-0_BIB5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1051\/ita\/1995290100751","article-title":"A note on read-k-times branching programs","volume":"29","author":"Jukna","year":"1995","journal-title":"Informatique Theorique Appl.\/Theoret. Inform. Appl."},{"issue":"3","key":"10.1016\/S0166-218X(98)00042-0_BIB6","first-page":"99","article-title":"Exponential lower bounds on the complexity of local and real-time branching programs","volume":"24","author":"Krause","year":"1988","journal-title":"J. EIK"},{"key":"10.1016\/S0166-218X(98)00042-0_BIB7","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(91)90021-S","article-title":"Separating the eraser turing machine classes Le, NLe, co \u2014 NLe and Pe","volume":"86","author":"Krause","year":"1991","journal-title":"Theoret. Computer Sci."},{"key":"10.1016\/S0166-218X(98)00042-0_BIB8","series-title":"Proc. FCT'87","first-page":"90","article-title":"Lower bounds on the complexity of real-time branching programs","volume":"vol. 278","author":"Kriegel","year":"1987"},{"key":"10.1016\/S0166-218X(98)00042-0_BIB9","series-title":"The Theory of Error-correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/S0166-218X(98)00042-0_BIB10","article-title":"A fast algorithm for the string editing problem and decision graph complexity","author":"Masek","year":"1976"},{"issue":"4","key":"10.1016\/S0166-218X(98)00042-0_BIB11_1","first-page":"765","article-title":"Ob odno\u01d0 bulevsko\u01d0 funktsii","volume":"169","author":"Nechiporuk","year":"1966","journal-title":"DAN SSSR"},{"issue":"4","key":"10.1016\/S0166-218X(98)00042-0_BIB11_2","first-page":"999","article-title":"On a Boolean function","volume":"7","author":"Nec\u0306iporuk","year":"1966","journal-title":"Sov. Math. Doklady"},{"key":"10.1016\/S0166-218X(98)00042-0_BIB12_1","first-page":"61","article-title":"Nizhnie otsenki slozhnosti realizatsii kharakteristicheskikh funktsi\u012d dvoichnykh kodov binarnymi programmami","volume":"51","author":"Okolnishnikova","year":"1991","journal-title":"Metody diskretnogo analiza"},{"key":"10.1016\/S0166-218X(98)00042-0_BIB12_2","first-page":"61","article-title":"Lower bounds for branching programs computing characteristic functions of binary codes","volume":"51","author":"Okolnishnikova","year":"1991","journal-title":"Metody Discretnogo Analiza"},{"key":"10.1016\/S0166-218X(98)00042-0_BIB13","series-title":"Proc. FCT'91","first-page":"47","article-title":"Lower bounds for deterministic and nondeterministic branching programs","volume":"vol. 529","author":"Razborov","year":"1991"},{"key":"10.1016\/S0166-218X(98)00042-0_BIB14","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0304-3975(96)00183-1","article-title":"A lower bound on branching programs reading some bits twice","volume":"172","author":"Savick\u00fd","year":"1997","journal-title":"Theoret. Computer Sci."},{"issue":"1","key":"10.1016\/S0166-218X(98)00042-0_BIB15","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1006\/jcss.1996.0050","article-title":"New lower bounds and hierarchy results for restricted branching programs","volume":"53","author":"Sieling","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(98)00042-0_BIB16","series-title":"Proc. of Workshop on Graph-Theoretic Concepts in Computer Science WG'94","first-page":"359","article-title":"New lower bounds and hierarchy results for Restricted Branching Programs","volume":"vol. 903","author":"Sieling","year":"1994"},{"key":"10.1016\/S0166-218X(98)00042-0_BIB17","series-title":"The Complexity of Boolean Functions","author":"Wegener","year":"1987"},{"key":"10.1016\/S0166-218X(98)00042-0_BIB18","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/42282.46161","article-title":"On the complexity of branching programs and decision trees for clique functions","volume":"35","author":"Wegener","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(98)00042-0_BIB19","series-title":"Proc. MFCS'84","first-page":"562","article-title":"An exponential lower bound for one-time-only branching programs","volume":"vol. 176","author":"\u017d\u00e1k","year":"1984"},{"key":"10.1016\/S0166-218X(98)00042-0_BIB20","series-title":"Proc. MFCS'95","first-page":"319","article-title":"A superpolynomial lower bound for (1, +k(n))-branching programs","volume":"vol. 969","author":"\u017d\u00e1k","year":"1995"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000420?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000420?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:51:36Z","timestamp":1556131896000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98000420"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,7]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,7]]}},"alternative-id":["S0166218X98000420"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00042-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,7]]}}}