On boolean lowness and boolean highness

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

Volumn 1449, Issue , 1998, Pages 147-157

  Reith, Steffen ^a   Wagner, Klaus W ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

Advice; Boolean hierarchy; Boolean highness; Boolean lowness; Collapse; Computational complexity; Hard easy; Highness; Lowness; Polynomial time hierarchy

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION;

ADVICE; BOOLEAN HIERARCHY; BOOLEAN HIGHNESS; BOOLEAN LOWNESS; COLLAPSE; HARD/EASY; HIGHNESS; LOWNESS; POLYNOMIAL-TIME HIERARCHY;

COMBINATORIAL MATHEMATICS;

EID: 0010580601     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68535-9_18     Document Type: Conference Paper

References (19)

1. [BCO93] R. Beigel, R. Chang, and M. Ogihara. A relationship between difference hierarchies and relativized polynomial hierarchies. Mathematical Systems Theory, 26: 293-310, 1993. 147, 148, 152, 155.
2. [BF96] H. Buhrmann and L. Fortnow. Two queries. TR 96-20, University of Chicago, Department of Computer Science, 1996. 152.
3. [CGH+88] J.-Y. Cai, T. Gundermann, J. Hartmanis, L. A. Hemachandra, V. Sewelson, K. Wagner, and G. Wechsung. The boolean hierarchy I: Structural properties. SIAM Journal on Computing, 17(6): 1232-1252, 1988. 149.
4. [CH86] J. Cai and L. Hamachandra. The boolean hierarchy: Hardware over NP. Proceedings of the Structure in Complexity Theory Conference, 223: 105-124, 1986. 149.
5. [Cha97] R. Chang. Bounded queries, approximation and the boolean hierarchy. TR CS 97-04, University of Maryland, Department of Computer Science and Electrical Engineering, 1997. 148, 152, 155.
6. [CK96] R. Chang and J. Kadin. The boolean hierarchy and the polynomial hierarchy: A closer connection. SIAM Journal on Computing, 25(2): 340, 1996. 147, 148, 152, 155.
7. [Coo74] S. B. Cooper. Minimal pairs and high recursively enumerable degree. Journal of Symbolic Logic, 39: 655-660, 1974. 147.
8. [HHH97a] L. A. Hemaspaandra, E. Hemaspaandra, and H. Hempel. A downward translation in the polynomial hierarchy. In Proc. of the 14th STACS, volume 1200 of LNCS. Springer Verlag, 1997. 152.
9. [HHH97b] L. A. Hemaspaandra, E. Hemaspaandra, and H. Hempel. Translating equality downwards. TR 657, University of Rochester, Department of Computer Science, 1997. 152.
10. [HHH98] E. Hemaspaandra, L. Hemaspaandra, and H. Hempel. What's up with downward collapse: Using the easy-hard technique to link boolean and polynomial hierarchy collapses. TR 682, University of Rochester, Department of Computer Science, February 1998. 155.
11. [Kad88] J. Kadin. The polynomial time hierarchy collapses if the boolean hierarchy collapses. SIAM Journal on Computing, 17(6): 1263-1282, 1988. 147, 148, 152, 155.
12. [Köb85] J. Köbler. Untersuchungen verschiedener polynomieller Reduktionsklassen von NP. Diploma Thesis, Universität Stuttgart, 1985. 149.
13. [KSW87] J. Köbler, U. Schöning, and K. W. Wagner. The difference and truth-table hierarchies for NP. R. A. I. R. O. Theoretical Informatics and Applications, 21(4): 419-435, 1987. 149.
14. [Sch83] U. Schöning. A low and a high hierarchy within NP. Journal of Computer and System Sciences, 27: 14-28, 1983. 147.
15. [Sch85] U. Schöning. Complexity and Structure, volume 211 of LNCS. Springer-Verlag, 1985. 147, 150.
16. [Soa74] R. I. Soare. Automorphisms of the lattice of recursively enumerable sets. Bulletin of the American Mathematical Society, 80: 53-58, 1974. 147.
17. [Wag87] K. W. Wagner. Number-of-query hierachies. TR 158, University of Augsburg, 1987. 147, 148.
18. [Wag97] K. W. Wagner. A note on bounded queries and the difference hierarchy. TR 137, Institut für Informatik, Universität Würzburg, 1997. 149.
19. [WW85] G. Wechsung and K. Wagner. On the boolean closure of NP, manuscript. Extended abstract as: Wechsung, G., On the boolean closure of NP. In Proc. of the Conference of Foundations on Computation Theory, volume 199 of LNCS, pages 485-493. Springer Verlag, 1985. 149.