On the structure of complete sets: Almost everywhere complexity and infinitely often speedup

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1976-October, Issue , 1976, Pages 76-80

  Berman, Leonard ^a  

^a Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMPLETE SETS; NON DETERMINISM; POLYNOMIAL-TIME; SPEED UP;

POLYNOMIAL APPROXIMATION;

EID: 85031523012     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1976.4567890     Document Type: Conference Paper

References (8)

1. Blum, M. "A machine-independent theory of the complexity of recursive functions", JACM 19, 2, 322-336.
2. Hartmanis, J. "On effective speed-up and long proofs of trivial theorems in formal theories", Cornell University, TR-254, Ithaca, NY, July 1975.
3. Hartmanis, J. and L. Berman. "On isomorphism and density of NP and other complete sets", 1976 SIGACT.
4. Ropcroft, J., W. Paul, and L. Valiant, "On time versus space and related problems", 1975 FOCS.
5. Lynch, N. "On reducibility to complex and sparse sets", JACM, Vol. 22, # 3, 341-345.
6. Lynch, N. "Complexity-Class-Encoding Sets", manuscript.
7. Rabin, M. O. "Degree of difficulty of computing, a function and a partial ordering of recursive sets", Tech. Rpt. 2, Hebrew University, Herusalem, Israel, 1960.
8. Stockmeyer, L. J. "The complexity of decision problems in automata theory and logic", Project MAC, Report MAC, TR-133, MIT, Cambridge, Mass., July 1974.