Computational complexities of diophantine equations with parameters

DOI10.1016/0196-6774(87)90013-7MaRDI QIDQ3781731zbMATH OpenOpenAlexFDO

Authors 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 of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Diophantine equations in many variables (11D72) Diophantine equations (11D99) Decidability (number-theoretic aspects) (11U05)

Recommendations

• Sentences over integral domains and their computational complexities
• Questions of decidability and undecidability in Number Theory
• Complexity of Sentences over Number Rings
• Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy
• Complexity of Subcases of Presburger Arithmetic

Cited in

(24)

• Polynomial time algorithms for sentences over number fields
• Computational complexity of winning strategies in two-person polynomial games
• Sentences over integral domains and their computational complexities
• A direct method for simulating partial recursive functions by Diophantine equations
• Skolem functions of arithmetical sentences.
• Approximate solutions of polynomial equations.
• The bounds of Skolem functions and their applications
• Uncomputably large integral points on algebraic plane curves?
• Max-min of polynomials and exponential Diophantine equations. II.
• scientific article; zbMATH DE number 3860383 (Why is no real title available?)
• Complexity of Subcases of Presburger Arithmetic
• scientific article; zbMATH DE number 4154522 (Why is no real title available?)
• Note on Quantifier Prefixes Over Diophantine Equations
• Classification of Quantifier Prefixes Over Exponential Diophantine Equations
• Provability and Decidability of Arithmetical Universal-Existential Sentences
• On the decidability of Diophantine problems in combinatorial geometry
• scientific article; zbMATH DE number 4112574 (Why is no real title available?)
• ANEW RELATION‐COMBINING THEOREM AND ITS APPLICATION
• Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy
• Ising Machines for Diophantine Problems in Physics
• Mixed quantifier prefixes over Diophantine equations with integer variables
• Further results on Hilbert's tenth problem
• Computational complexity of sentences over fields
• Max-min of polynomials and exponential Diophantine equations

This page was built for publication: Computational complexities of diophantine equations with parameters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3781731)