The complexity of computing the size of an interval

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

Volumn 2076 LNCS, Issue , 2001, Pages 1040-1051

  Hemaspaandra, Lane A ^a   Kosub, Sven ^b   Wagner, Klaus W ^b  

^a University of Rochester   (United States)

^b UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL LINGUISTICS; POLYNOMIAL APPROXIMATION;

COUNTING FUNCTIONS; INTERVAL SIZE; NATURAL NUMBER; P-FUNCTION; PARTIAL ORDER; POLYNOMIAL TIME FUNCTIONS; POLYNOMIAL-TIME; PRIMALITY;

POLYNOMIAL APPROXIMATION; POLYNOMIALS;

EID: 84879514185     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_84     Document Type: Conference Paper

References (24)

1. D. P. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. International Series in Computer Science. Prentice Hall, New York, 1994.
2. A. E. F. Clementi, J. D. P. Rolim, and L. Trevisan. Recent advances towards proving P=BPP. Bulletin of the EATCS, 64:96-103, 1998.
3. S. A. Cook. The complexity of theorem-proving procedures. In Proceedings 3rd ACM Symposium on Theory of Computing, pages 151-158, 1971.
4. S. Fenner, L. Fortnow, and S. Kurtz. Gap-definable counting classes. Journal of Computer and System Sciences, 48:116-148, 1994.
5. J. Gill. Computational complexity of probabilistic complexity classes. SIAM Journal on Computing, 6:675-695, 1977.
6. A. V. Goldberg and M. Sipser. Compression and ranking. SIAM Journal on Computing, 20(3):524-536, 1991.
7. J. Goldsmith, L. A. Hemachandra, D. Joseph, and P. Young. Near-testable sets. SIAM Journal on Computing, 20(3):506-523, 1991.
8. J. Grollmann and A. L. Selman. Complexity measures for public-key cryptosys-tems. SIAM Journal on Computing, 17(2):309-335, 1988.
9. H. Hempel and G. Wechsung. The operators min and max on the polynomial hierarchy. International Journal of Foundations of Computer Science, 11(2):315-342, 2000.
10. U. Hertrampf, H. Vollmer, and K. W. Wagner. On balanced versus unbalanced computation trees. Mathematical Systems Theory, 29:411-421, 1996.
11. K. Ko. On self-reducibility and weak P-selectivity. Journal of Computer and System Sciences, 26:209-221, 1983.
12. S. Kosub. A note on unambiguous function classes. Information Processing Letters, 72(5-6):197-203, 1999.
13. R. E. Ladner. Polynomial space counting problems. SIAM Journal on Computing, 18(6):1087-1097, 1989.
14. L. Levin. Universal sorting problems. Problems of Information Transmission, 9:265-266, 1973.
15. A. R. Meyer and M. Paterson. With what frequency are apparently intractable problems difficult Technical Report MIT/LCS/TM-126, Laboratory for Computer Science, MIT, Cambridge, MA, 1979.
16. A. R. Meyer and L. J. Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential time. In Proceedings 13th Symposium on Switching and Automata Theory, pages 125-129. IEEE Computer Society Press, Los Alamitos, 1972.
17. G. L. Miller. Riemann's hypothesis and tests for primality. Journal of Computer and System Sciences, 13:300-317, 1976.
18. M. Ogiwara and L. A. Hemachandra. A complexity theory of feasible closure properties. Journal of Computer and System Sciences, 46:295-325, 1993.
19. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, Reading, 1994.
20. J. Simon. On Some Central Problems in Computational Complexity. PhD thesis, Cornell University, Ithaca, 1975.
21. L. J. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3:1-22, 1977.
22. L. G. Valiant. Relative complexity of checking and evaluation. Information Processing Letters, 5:20-23, 1976.
23. L. G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):411-421, 1979.
24. H. Vollmer and K. W. Wagner. Complexity classes of optimization functions. Information and Computation, 120:198-219, 1995.