Diophantine complexity
- 1 October 1976
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 81-88
- https://doi.org/10.1109/sfcs.1976.13
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- NP-complete decision problems for quadratic polynomialsPublished by Association for Computing Machinery (ACM) ,1976
- Computational complexity of decision procedures for polynomialsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- Reduction of an arbitrary diophantine equation to one in 13 unknownsActa Arithmetica, 1975
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- Hilbert's Tenth Problem is UnsolvableThe American Mathematical Monthly, 1973
- The Decision Problem for Exponential Diophantine EquationsAnnals of Mathematics, 1961