Computational complexities of diophantine equations with parameters

DOI10.1016/0196-6774(87)90013-7zbMath0641.03009OpenAlexW2010073966MaRDI QIDQ3781731

Shih-Ping Tung

Publication date: 1987

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(87)90013-7

zbMATH Keywords

diophantine equations with parameters

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Diophantine equations in many variables (11D72) Diophantine equations (11D99)

Related Items

Further results on Hilbert's tenth problem, Ising Machines for Diophantine Problems in Physics, Skolem functions of arithmetical sentences., Computational complexity of sentences over fields, Uncomputably large integral points on algebraic plane curves?, Polynomial time algorithms for sentences over number fields, Computational complexity of winning strategies in two-person polynomial games, Max-min of polynomials and exponential Diophantine equations, Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy, Max-min of polynomials and exponential Diophantine equations. II., Sentences over integral domains and their computational complexities, Approximate solutions of polynomial equations.