Complexity classes with complete problems between P and NP-C

This publication has 19 references indexed in Scilit:

• On helping by robust oracle machines
  Theoretical Computer Science, 1987
• Complexity classes without machines: On complete languages for UP
  Published by Springer Nature ,1986
• Robust algorithms: A different approach to oracles
  Theoretical Computer Science, 1985
• Immunity, Relativizations, and Nondeterminism
  SIAM Journal on Computing, 1984
• Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1980
• Computational Complexity of Probabilistic Turing Machines
  SIAM Journal on Computing, 1977
• Complete problems for deterministic polynomial time
  Theoretical Computer Science, 1976
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
  SIAM Journal on Computing, 1975
• On the Structure of Polynomial Time Reducibility
  Journal of the ACM, 1975
• Tally languages and complexity classes
  Information and Control, 1974