{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:36Z","timestamp":1725456336886},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634379"},{"type":"electronic","value":"9783540695479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0029975","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:24:59Z","timestamp":1133418299000},"page":"319-326","source":"Crossref","is-referenced-by-count":7,"title":["On P versus NP\u2229co-NP for decision trees and read-once branching programs"],"prefix":"10.1007","author":[{"given":"S.","family":"Jukna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Razborov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Savick\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Wegener","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"32_CR1","unstructured":"F. Ablayev (1996). Randomization and noudeterminism are incomparable for polynomial ordered binary decision diagrams. Manuscript."},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","volume":"24","author":"M. Ajtai","year":"1983","unstructured":"M. Ajtai (1983). \u03a3 1 1-formulae on finite structures. Annals of Pure and Applied Logic 24 1\u201348.","journal-title":"Annals of Pure and Applied Logic"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01305953","volume":"14","author":"A. Blokhuis","year":"1994","unstructured":"A. Blokhuis (1994). On the size of a blocking set in PG(2,p). Combinatorica 14 111\u2013114.","journal-title":"Combinatorica"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"M. Blum and R. Impagliazzo (1987). Generic oracles and oracle classes. In: Proc. of 28th IEEE FOCS, 118\u2013126.","DOI":"10.1109\/SFCS.1987.30"},{"key":"32_CR5","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1090\/S0002-9904-1970-12470-3","volume":"76","author":"A. A. Bruen","year":"1970","unstructured":"A. A. Bruen (1970). Baer subplanes and blocking sets. Bull. Amer. Math. Soc. 76 342\u2013344.","journal-title":"Bull. Amer. Math. Soc."},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0890-5401(89)90001-1","volume":"82","author":"A. Ehrenfeucht","year":"1989","unstructured":"A. Ehrenfeucht and D. Haussler (1989). Learning decision trees from random examples. Information and Computation 82 231\u2013246.","journal-title":"Information and Computation"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"M. Furst, J. Saxe and M. Sipser (1981). Parity, circuits and the polynomial time hierarchy. In: Proc. of 22nd IEEE FOCS, 260\u2013270.","DOI":"10.1109\/SFCS.1981.35"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0020-0190(97)00041-0","volume":"62","author":"A. Gil","year":"1997","unstructured":"A. Gil (1997). A simple function that requires exponential size read-once branching programs. Information Processing Letters 62,13\u201316.","journal-title":"Information Processing Letters"},{"key":"32_CR9","unstructured":"J. Hartmanis and L.A. Hemachandra (1987). One-way functions, robustness and non-isomorphism of NP-complete classes. Tech. Rep. DCS TR86-796, Cornell University."},{"key":"32_CR10","unstructured":"J. Hiistad (1989). Almost optimal lower bounds for small depth circuits. In: S. Micali, editor, Randomness and Computation (Advances in Computing Research, Vol. 5), 143\u2013170. JAI Press."},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(88)90166-1","volume":"57","author":"S. Jukna","year":"1988","unstructured":"S. Jukna (1988). Entropy of contact circuits and lower bounds on their complexity. Theor. Comput. Sci. 57 113\u2013129.","journal-title":"Theor. Comput. Sci."},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz and Y. Mansour (1991). Learning decision trees using the Fourier spectrum. In: Proc. of 23rd ACM STOC, 455\u2013464.","DOI":"10.1145\/103418.103466"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"N. Linial, Y. Mansour and N. Nisan (1989). Constant depth circuits, Fourier transforms and learnability. In: Proc. of 30th IEEE FOCS, 574\u2013579.","DOI":"10.1109\/SFCS.1989.63537"},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/3-540-54458-5_49","volume-title":"Proc. of FCT'91","author":"A. A. Razborov","year":"1991","unstructured":"A. A. Razborov (1991). Lower bounds for deterministic and nondeterministic branching programs. In: Proc. of FCT'91, Lecture Notes in Computer Science 529 (Springer, Berlin), 47\u201360."},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"M. Saks and A. Wigderson (1986). Probabilistic Boolean decision trees and the complexity of evaluating games. In: Proc. of 27th IEEE FOCS, 29\u201338.","DOI":"10.1109\/SFCS.1986.44"},{"key":"32_CR16","unstructured":"P. Savick\u00fd and S. \u017e\u00e1k (1996). A large lower bound for 1-branching programs, Electronic Colloquium on Computational Complexity (ECCC), Report # TR96-036, 1996."},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02125350","volume":"9","author":"G. Tardos","year":"1989","unstructured":"G. Tardos (1989). Query complexity, or why is it difficult to separate NP A\u2229co-NP A from P A by a random oracle A? Combinatorica 9 385\u2013392.","journal-title":"Combinatorica"},{"key":"32_CR18","unstructured":"I. Wegener (1987). The Complexity of Boolean Functions. Wiley-Teubner."},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"A. Yao (1985). Separating the polynomial-time hierarchy by oracles. In: Proc. of 26th IEEE FOCS 1\u201310.","DOI":"10.1109\/SFCS.1985.49"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:22:17Z","timestamp":1586593337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029975"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0029975","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}