Two queries

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1998, Pages 13-19

  Buhrman, H ^a   Fortnow, L ^b  

^a CWI   (Netherlands)

^b THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL SIZE;

COMPUTATIONAL COMPLEXITY;

EID: 0013446875     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.1998.694586     Document Type: Conference Paper

References (22)

1. [BBF98] R. Beigel, H. Buhrman, and L. Fortnow. NP might not be as easy as detecting unique solutions. In Proceedings of the 30th ACM Symposium on the Theory of Computing. ACM, New York, 1998. To appear.
2. [BC97] R. Beigel and R. Chang. Commutative queries. In Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems, pages 159-165, 1997. To appear in Information and Computation.
3. [BCG+96] N. Bshouty, R. Cleve, R. Gavaldà, S. Kannan, and C. Tamon. Oracles and queries that are sufficient for exact learning. Journal of Computer and System Sciences, 52(3):421-433, June 1996.
4. [BCO93] R. Beigel, R. Chang, and M. Ogihara. A relationship between difference hierarchies and relativized polynomial hierarchies. Mathematical Systems Theory, 26:293-310, 1993.
5. [BDG88] J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. Springer, 1988.
6. [BDG90] J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity II. Springer-Verlag, 1990.
7. [Cha97] R. Chang. Bounded queries, approximations and the boolean hierarchy. Technical Report TR CS-97-04, Department of Computer Science and Electrical Engineering, University of Maryland Baltimore County, 1997. To appear in Information and Computation.
8. [CK95] R. Chang and J. Kadin. On computing boolean connectives of characteristic functions. Mathematical Systems Theory, 28:173-198, 1995.
9. [CK96] R. Chang and J. Kadin. The Boolean hierarchy and the polynomial hierarchy: A closer connection. SIAM Journal on Computing, 25(2):340-354, April 1996.
10. [FR94] L. Fortnow and J. Rogers. Separability and one-way functions. In Proceedings of the 5th Annual International Symposium on Algorithms and Computation, volume 834 of Lecture Notes in Computer Science, pages 396-404. Springer, Berlin, 1994.
11. [GJ79] M. Garey and D. Johnson. Computers and intractability. A Guide to the theory of NPcompleteness. W. H. Freeman and Company, New York, 1979.
12. [HHH97a] E. Hemaspaandra, L. Hemaspaandra, and H. Hempel. A downward translation in the polynomial hierarchy. In Proceedings of the 14th Symposium on Theoretical Aspects of Computer Science, volume 1200 of Lecture Notes in Computer Science, pages 319-328. Springer, Berlin, 1997. To appear in the SIAM Journal on Computing.
13. [HHH97b] E. Hemaspaandra, L. Hemaspaandra, and H. Hempel. Translating equality downward. Technical Report TR 97-657, University of Rochester Department of Computer Science, April 1997.
14. [HKR93] S. Homer, S. Kurtz, and J. Royer. A note on many-one and 1-truth table complete sets. Theoretical Computer Science, 115(2):383-389, July 1993.
15. [HU79] J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Mass., 1979.
16. [Kad88] J. Kadin. The polynomial time hierarchy collapses if the Boolean hierarchy collapses. SIAM Journal on Computing, 17(6):1263-1282, December 1988.
17. [Kre88] M. Krentel. The complexity of optimization problems. Journal of Computer and System Sciences, 36:490-509, 1988.
18. [Lut97] J. Lutz. Observations on measure and lowness for p2. Theory of Computing Systems, 30(4):429-442, July/August 1997.
19. [Rog97] J. Rogers. The isomorphism conjecture holds and one-way functions exist relative to an oracle. Journal of Computer and System Sciences, 54(3):412-423, June 1997.
20. [TO92] S. Toda andM. Ogiwara. Counting classes are at least as hard as the polynomial-time hierarchy. SIAMJournal on Computing, 21(2):316-328, 1992.
21. [Yap83] C. Yap. Some consequences of nonuniform conditions on uniform classes. Theoretical Computer Science, 26:287-300, 1983.
22. [Zac88] S. Zachos. Probabilistic quantifiers and games. Journal of Computer and System Sciences, 36:433-451, 1988.