Complexity classes without machines: On complete languages for UP

This publication has 7 references indexed in Scilit:

• Complexity Measures For Public-Key Cryptosystems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
• The boolean hierarchy: Hardware over NP
  Published by Springer Nature ,1986
• On the unique satisfiability problem
  Information and Control, 1982
• Relationship between density and deterministic complexity of MP-complete languages
  Published by Springer Nature ,1978
• Computational Complexity of Probabilistic Turing Machines
  SIAM Journal on Computing, 1977
• Relative complexity of checking and evaluating
  Information Processing Letters, 1976
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971