Complexity classes without machines: On complete languages for UP

This publication has 8 references indexed in Scilit:

• The Boolean Hierarchy I: Structural Properties
  SIAM Journal on Computing, 1988
• Generic oracles and oracle classes
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1987
• Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
  Theoretical Computer Science, 1985
• On the unique satisfiability problem
  Information and Control, 1982
• Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
  SIAM Journal on Computing, 1981
• Computational Complexity of Probabilistic Turing Machines
  SIAM Journal on Computing, 1977
• On Isomorphisms and Density of $NP$ and Other Complete Sets
  SIAM Journal on Computing, 1977
• Relative complexity of checking and evaluating
  Information Processing Letters, 1976