Fine separation of average time complexity classes

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

Volumn 1046, Issue , 1996, Pages 331-343

  Cai, Jin Yi ^a   Selman, Alan L ^a  

^a State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ARBITRARY TIME; AVERAGE-CASE COMPLEXITY; POLYNOMIAL-TIME; TIME BOUND; TIME COMPLEXITY;

POLYNOMIAL APPROXIMATION;

EID: 84948167886     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60922-9_28     Document Type: Conference Paper

References (18)

1. [BS85] J. Balcázar and U. Schöning. Bi-immune sets for complexity classes. Mathematical Systems Theory, 18:1-10, 1985.
2. [BW95] J. Belanger and J. Wang. Rankable distributions do not provide harder instances than uniform distributions. Manuscript, 1995.
3. [BDCGL92] S. Ben-David, B. Chor, O. Goldreich, and M. Luby. On the theory of average case complexity. J. Computer System Sci., 44(2):193-219, 1992.
4. [CR73] S. Cook and R. Reckow. Time bounded random access machines. J. Comput. System Sci., 7:354-375, 1973.
5. [GHS87] J. Geske, D. Huynh, and A. Selman. A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees. In STACS 1987, 1987.
6. [GHS91] J. Geske, D. Huynh, and J. Seiferas. A note on almost-everywhere-complex sets and separating deterministic-time-complexity classes. Inf. and Comput., 92(1):97-104, 1991.
7. [Gur91] Y. Gurevich. Average case completeness. J. Comput. System Sci., 42:346-398, 1991.
8. [Har24] G. Hardy. Orders of Infinity, The 'infinitärcałcül' of Paul du Bois-Reymond, volume 12 of Cambridge Tracts in Mathematics and Mathematical Physics. Cambridge University Press, London, 2nd edition, 1924.
9. [Harll] G. Hardy. Properties of logarithmicoexponential functions. Proc. London Math. Soc., (2), 10:54-90, 1911.
10. [HS65] J. Hartmanis and R. Stearns. On the computational complexity of algorithms. Trans. Amer. Math. Soc., 117:285-306, 1965.
11. [Ko83] K. Ko. On the definition of some complexity classes of real numbers. Math. Systems Theory, 16:95-109, 1983.
12. [Lev86] L. Levin. Average case complete problems. SIAM J. of Comput., 15:285-286, 1986.
13. [LV92] M. Li and P. Vitányi. Average case complexity under the universal distribution equals worst-case complexity. Inf. Proc. Lett., 42:145-149, 1992.
14. [LM94] J. Lutz and E. Mayordomo. Cook versus Karp-Levin: Separating completeness notions if NP is not small. In Proc. 11th Annual Symp. on Theor. Aspects of Com. Sci., Lecture Notes in Computer Science, Springer-Verlag, 775.415-426, 1994.
15. [May94] E. Mayordomo. Almost every set in exponential time is P-bi-immune. Theoret. Comput. Sci., 136:487-506, 1994.
16. [Rac95] C. Rackoff. Personal communication.
17. [RS93] R. Reishuk and C. Schindelhauer Precise average case complexity. In Proc. 10th Annual Symp. on Theoretical Aspects of Computer Sci. v. 665 of Lecture Notes in Computer Sci., pages 650-661. Springer Verlag. 1993.
18. [SY95] R. Schuler and T. Yamakami Sets computable in polynomial time on the average. In Proc. First Annual Conf. on Computing and Combinatorics v. 959 of Lecture Notes in Computer Sci., pages 400-409. Springer Verlag. 1995.