The complexity of ODDAn

Journal of Symbolic Logic

Volumn 65, Issue 1, 2000, Pages 1-18

  Beigel, Richard ^a   Gasarch, William ^b   Kummer, Martin ^c   Martin, Georgia ^d   McNicholl, Timothy ^e   Stephan, Frank ^f  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^b University of Maryland ^*  (United States)

^c CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

^d University of Dallas ^*  (United States)

^e UNIVERSITY OF DALLAS   (United States)

^f UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034385253     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2586523     Document Type: Article

References (28)

1. RICHARD BEIGEL, Functionally supportive sets, Technical Report 87-10, The Johns Hopkins University, Department of Computer Science, 1987.
2. _, Query-limited reducibilities, Ph.D. thesis, Stanford University, 1987, Also available as Report No. STAN-CS-88-1221.
3. _, When are k + 1 queries better than k?, Technical Report 88-06, The Johns Hopkins University, Department of Computer Science, 1988.
4. RICHARD BEIGEL, WILLIAM GASARCH, and EFIM KINBER, Frequency computation and bounded queries, Theoretical Computer Science, vol. 163 (1996), pp. 177-192.
5. RICHARD BEIGEL, WILLIAM GASARCH, MARTIN KUMMER, GEORGIA MARTIN, TIMOTHY McNICHOLL, and FRANK STEPHAN, On the query complexity of sets, 21st International Symposium on Mathematical Foundations of Computer Science (MFCS '96), Cracow, Poland, 1996.
6. RICHARD BEIGEL, WILLIAM I. GASARCH, JOHN T. GILL, and JAMES C. OWINGS, Terse, superterse, and verbose sets, Information and Computation, vol. 103(1) (March 1993), pp. 68-85.
7. RICHARD BEIGEL, WILLIAM I. GASARCH, and LOUISE HAY, Bounded query classes and the difference hierarchy, Archive for Mathematical Logic, vol. 29(2) (December 1989), pp. 69-84.
8. RAVI BOPPANA and MICHAEL SIPSER, The complexity of finite functions, Handbook of theoretical computer science, volume A: Algorithms and complexity (Jan van Leeuwen, editor), MIT Press and Elsevier, The Netherlands, 1990, pp. 757-804.
9. JIN-YI CAI and LANE A. HEMACHANDRA. Enumerative counting is hard, Information and Computation, vol. 82(1) (July 1989), pp. 34-44.
10. MERRICK FURST, JAMES B. SAXE, and MICHAEL SIPSER, Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, vol. 17(1) (April 1984), pp. 13-27.
11. WILLIAM GASARCH, Bounded queries in recursion theory: A survey, Proceedings of the 6th Annual Conference on Structure in Complexity Theory, IEEE Computer Society Press, June 1991, pp. 62-78.
12. WILLIAM I. GASARCH and GEORGIA A. MARTIN, Bounded queries in recursion theory, Birkhäuser, Boston, 1999.
13. ODED GOLDREICH, NOAM NISAN, and AVI WIGDERSON, On Yao's XOR-lemma, Technical Report TR95-050, Electronic Colloquium on Computational Complexity, 1995.
14. JOHAN HÅSTAD, Computational limitations of small-depth circuits, MIT Press, Cambridge, MA, 1987.
15. n and bounded truth-table reducibility, Discrete Mathematics, vol. 21(1) (January 1978), pp. 31-46.
16. CARL G. JOCKUSCH, Degrees of functions with no fixed points, Logic, methodology, and philosophy of science VIII (J.E. Fenstad, I. Frolov, and R. Hilpinen, editors), North Holland, 1989, pp. 191-201.
17. _, Semirecursive sets and positive reducibility, Transactions of the American Mathematical Society, vol. 131 (May 1968), pp. 420-436.
18. 1 classes and degrees of theories, Transactions of the American Matmematical Society, vol. 173 (1972), pp. 33-56.
19. 1 classes and complete extensions of PA. Recursion theory week at Oberwolfach, Lecture Notes in Mathematics, vol. 1141, Springer-Verlag, Berlin, 1985, pp. 245-259.
20. MARTIN KUMMER, A proof of Beigel's cardinality conjecture, this JOURNAL, vol. 57(2) (June 1992), pp. 677-681.
21. MARTIN KUMMER and FRANK STEPHAN, Effective search problems, Mathematical Logic Quarterly, vol. 40 (1994), pp. 224-236.
22. LEONID A. LEVIN, One way functions and pseudorandom generators, Combinatorica, vol. 7 (1987), pp. 357-363.
23. WEBB MILLER and DONALD A. MARTIN, The degree of hyperimmune sets, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 14 (1968), pp. 159-166.
24. PIERGIORGIO ODIFREDDI, Classical recursion theory (Volume I), North-Holland, Amsterdam, 1989.
25. HARTLEY ROGERS, JR., Theory of recursive functions and effective comput ability, McGraw Hill, New York, 1967.
26. ROMAN SMOLENSKY, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, Proceedings of the 19th ACM Symposium on Theory of Computing, 1987, pp. 77-82.
27. ROBERT I. SOARE, Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1987.
28. ANDREW C. YAO, Separating the polynomial-time hierarchy by oracles, Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, 1985, pp. 1-10.