zbMATH — the first resource for mathematics

An arithmetical characterization of NP. (English) Zbl 0498.03023

03D15 Complexity of computation (including implicit computational complexity)
03D20 Recursive functions and relations, subrecursive hierarchies
03D25 Recursively (computably) enumerable sets and degrees
Full Text: DOI
[1] Adleman, L.; Manders, K., Diophantine complexity, Proc. 17th annual IEEE symposium on foundations of computer science, 81-88, (1976)
[2] Davis, M., Computability and unsolvability, (1958), McGraw-Hill New York · Zbl 0080.00902
[3] Garey, M.; Johnson, D., Computers and intractability: A guide to the theory of NP-completeness, (1979), Freeman San Francisco · Zbl 0411.68039
[4] Hanson, D., On the product of the primes, Canad. math. bull., 15, 33-37, (1972) · Zbl 0231.10008
[5] Harrow, K., The bounded arithmetic hierarchy, Information and control, 36, 102-117, (1978) · Zbl 0374.02019
[6] Karp, R., Reducibility among combinatorial problems, (), 85-104 · Zbl 0366.68041
[7] Matijasevińć, Y., Enumerable sets are Diophantine, Dokl. akad. nauk SSSR, Soviet math. dokl., 11, 354-358, (1970), English translation · Zbl 0212.33401
[8] Stockmeyer, L., The polynomial-time hierarchy, Theoret. comput. sci., 3, 1-22, (1977) · Zbl 0353.02024
[9] Wrathall, C., Complete sets and the polynomial-time hierarchy, Theoret. comput. sci., 3, 23-33, (1977) · Zbl 0366.02031
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.