乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:43:36Z","timestamp":1710326616360},"reference-count":25,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"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":4825,"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":[[2000,5]]},"DOI":"10.1016\/s0304-3975(98)00219-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:38:29Z","timestamp":1027636709000},"page":"347-362","source":"Crossref","is-referenced-by-count":14,"title":["A read-once lower bound and a (1,+k)-hierarchy for branching programs"],"prefix":"10.1016","volume":"238","author":[{"given":"P.","family":"Savick\u00fd","sequence":"first","affiliation":[]},{"given":"S.","family":"\u017d\u00e1k","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00219-9_BIB1","unstructured":"F. Ablayev, Randomization and nondeterminism are incomparable for polynomial ordered binary decision diagrams, Proc. 24th ICALP, Lecture Notes in Computer Science, vol. 1256, Springer, Berlin, 1997, pp. 195\u2013202."},{"key":"10.1016\/S0304-3975(98)00219-9_BIB2","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1006\/jnth.1996.0029","article-title":"The polynomial method and restricted sums of congruence classes","volume":"56","author":"Alon","year":"1996","journal-title":"J. Number Theory"},{"key":"10.1016\/S0304-3975(98)00219-9_BIB3","unstructured":"A.E. Andreev, J.L. Baskakov, A.E.F. Clementi, J.D.P. Rolim, Small pseudo-random sets yield hard functions: new tight explicit lower bounds for branching programs, Revision 2 of TR97-053, ECCC, Trier."},{"key":"10.1016\/S0304-3975(98)00219-9_BIB4","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. Systems Sci."},{"key":"10.1016\/S0304-3975(98)00219-9_BIB5","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\/S0304-3975(98)00219-9_BIB6","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(94)00181-H","article-title":"On the size of binary decision diagrams representing Boolean functions","volume":"145","author":"Breitbart","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00219-9_BIB7","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(98)00219-9_BIB8","doi-asserted-by":"crossref","unstructured":"P.E. Dunne, Lower bounds on the complexity of one-time-only branching programs, Proc. FCT, Lecture Notes in Computer Science, vol. 199, 1985, 90\u201399.","DOI":"10.1007\/BFb0028795"},{"issue":"1","key":"10.1016\/S0304-3975(98)00219-9_BIB9","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0020-0190(97)00041-0","article-title":"A simple function that requires exponential size read-once branching programs","volume":"62","author":"G\u00e1l","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(98)00219-9_BIB10","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":"Jukna","year":"1988","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(98)00219-9_BIB11","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":"RAIRO Theoret. Inform. Appl."},{"issue":"3","key":"10.1016\/S0304-3975(98)00219-9_BIB12","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0166-218X(98)00042-0","article-title":"Neither reading few bits twice nor reading illegally helps much","volume":"85","author":"Jukna","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(98)00219-9_BIB13","unstructured":"K. Kriegel, S. Waack, Lower bounds on the complexity of real-time branching programs, Proc. FCT, Lecture Notes in Computer Science, vol. 278, 1987, pp. 90\u201399."},{"key":"10.1016\/S0304-3975(98)00219-9_BIB14","first-page":"61","article-title":"Lower bounds for branching programs computing characteristic functions of binary codes (in Russian)","volume":"51","author":"Okolnishnikova","year":"1991","journal-title":"Metody diskretnogo Analiza"},{"key":"10.1016\/S0304-3975(98)00219-9_BIB15","doi-asserted-by":"crossref","unstructured":"S.J. Ponzio, A lower bound for integer multiplication with read-once branching programs, Proc. 27's Ann. ACM Symp. on the Theory of Computing, Las Vegas, 1995, pp. 130\u2013139.","DOI":"10.1145\/225058.225098"},{"key":"10.1016\/S0304-3975(98)00219-9_BIB16","series-title":"Distribution of Prime Numbers (in German), Primzahlverteilung","author":"Prachar","year":"1957"},{"key":"10.1016\/S0304-3975(98)00219-9_BIB17","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. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00219-9_BIB18","unstructured":"P. Savick\u00fd, S. \u017d\u00e1k, A large lower bound for 1-branching programs, TR96-036, ECCC, Trier."},{"key":"10.1016\/S0304-3975(98)00219-9_BIB19","doi-asserted-by":"crossref","unstructured":"P. Savick\u00fd, S. \u017d\u00e1k, A hierarchy for (1,+k)-branching programs with respect to k, Lecture Notes in Computer Science, vol. 1295, Proc. MFCS\u201997, 1997, pp. 478\u2013487.","DOI":"10.1007\/BFb0029991"},{"issue":"1","key":"10.1016\/S0304-3975(98)00219-9_BIB20","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\/S0304-3975(98)00219-9_BIB21","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\/S0304-3975(98)00219-9_BIB22","doi-asserted-by":"crossref","unstructured":"J. Simon, M. Szegedy, A new lower bound theorem for read only once branching programs and its applications, in: J. Cai (Ed.), Adv. Comput. Complexity Theory, DIMACS Series, vol. 13, AMS, 1993, pp 183\u2013193.","DOI":"10.1090\/dimacs\/013\/11"},{"key":"10.1016\/S0304-3975(98)00219-9_BIB23","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":"JACM"},{"key":"10.1016\/S0304-3975(98)00219-9_BIB24","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\/S0304-3975(98)00219-9_BIB25","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":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002199?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002199?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T23:09:08Z","timestamp":1580857748000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598002199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0304397598002199"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00219-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}