On p versus NP∩co-NP for decision trees and read-once branching programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1295, Issue , 1997, Pages 319-326

  Jukna, S ^a   Razborov, A ^b   Savicky P ^c   Wegener, L ^d  

^a UNIVERSITY OF TRIER   (Germany)

^b STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

^c INSTITUTE OF MATHEMATICS   (Czech Republic)

^d TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES;

BLOCKING SET; PROJECTIVE PLANES; READ-ONCE BRANCHING PROGRAMS;

BOOLEAN FUNCTIONS;

EID: 84947808616     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0029975     Document Type: Conference Paper

References (19)

1. F. Ablayev (1996). Randomization and nondeterminism are incomparable for polynomial ordered binary deci-sion diagrams. Manuscript.
2. M. Ajtai (1983).,UƩ⅟₁-formttlae on finite structures. Annals of Pure and Applied Logic 24 1-48.
3. A. Blokhnis (1994). On the size of a blocking set in PG(2,p). Cornbinatorlca 14 111-114.
4. M. Blum and R. Impagliazzo (1987). Generic oracles and oracle classes. In: Proc. of28th IEEE FOGS, 118-126.
5. A. A. Bruen (1970). Boer subpianes and blocking sets. Bull. Amer. Math. Soc. 76 342-344.
6. A. Ehrenfeucht and D. Haussler (1989). Learning decision trees from random examples. Information and Computation 82 231-246.
7. M. First, J. Saxe and M. Sipser (1981). Parity. circuits and the polynomial time hierarchy. In: Proc. of 22nd IEEE FOGS, 260-270.
8. A. Gál (1997). A simple function that requires exponential size read-once branching programs. Information Processing Letters 62, 13-16.
9. J. Hartmanis and L.A. Hemachandra (1987). One-way functions, robustness and non-isomorphism of NPo complete classes. Tech. Rep. DCS TR86-796, Cornen University.
10. J. Håstad (1989). Almost optimal lower bounds for small depth circuits. In: S. Micali, editor, Randomness and Computation (Advances in Computing Research, Vol. 5), 143-170. JAI Press.
11. S. Jukna (1988). Entropy of contact circuits and lower bounds on their complexity. Theor. Comput. Sci, 57 113-129.
12. E. Kushilevitz and Y. Mansour (1991). Learning decision trees using the Fourier spectrum. In: Proc. of 23rd A CM STOC, 455-464.
13. N. Linial, Y. Mansour and N. Nisan (1989). Constant depth circuits, Fourier transforms and learnabillty. In: Proc. of 30th IEEE FOGS, 574-579.
14. 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-60.
15. M. Salts and A. Wigderson (1986). Probabitistic Boolean decision trees and the complexity of evaluating games, In: Proc. of 27th IEEE FOGS, 29-38.
16. P. Savický and S Žák (1996). A large lower bound for 1-branching programs, Electronic Colloquium on Computational Complexity (ECCC), Report # TR96-036, 1996.
17. G. Tardos (1989). Query complexity, or why is it difficult to separate NPA∩co-NPA from PA by a random oracle A? Gombinatorica 9 385-392.
18. I. Wegener (1987). The Complexity of Boolean Functions. Wiley-Teubner.
19. A. Yao (1985). Separating the polynomial-time hierarchy by oracles. In: Proc. of 26th IEEE FOGS, 1-10.