- 70 Downloads
In 1975, Adelman and Manders defined the class D of “nondeterministic Diophantine” languages. A language L is in D if and only if there are polynomials p and q such that x ∈ L if and only if there exist y 1, …, y n < 2 q(|x|) such that p(x, y 1,…, y n ) = 0 (in this formula, bit strings are treated as positive integers). While, clearly, D is a subset of NP, it is unknown whether these classes coincide.
The well-known polynomial hierarchy PH consists of complexity classes constructed from NP. We consider a hierarchy constructed in a similar way from D. We prove that D lies at the second level of the polynomial hierarchy, and hence all classes of the two hierarchies are successively contained in one another. Bibliography: 6 titles.
KeywordsPositive Integer Complexity Class Polynomial Hierarchy
Unable to display preview. Download preview PDF.
- 1.L. M. Adleman and K. L. Manders, “Computational complexity of decision procedures for polynomials (extended abstract),” in: IEEE Symposium on Foundations of Computer Science (1975), pp. 169–177.Google Scholar
- 2.L. M. Adleman and K. L. Manders, “Diophantine complexity,” in: IEEE Symposium on Foundations of Computer Science (1976), pp. 81–88.Google Scholar
- 3.H. Lipmaa. “On Diophantine complexity and statistical zero-knowledge arguments,” in: ASIACRYPT;03 (2003), pp. 398–415.Google Scholar
- 4.Yu. V. Matiyasevich, “The Diophantineness of enumerable sets,” Dokl. Akad. Nauk SSSR, 191, No. 2, 278–282 (1970).Google Scholar
- 5.Yu. V. Matiyasevich, Hilbert’s Tenth Problem, MIT Press, Cambridge, Massachusetts (1993).Google Scholar