Generic complexity of the Diophantine problem

DOI10.1515/gcc-2013-0004zbMath1348.03036OpenAlexW2076902585MaRDI QIDQ2873316

Alexander N. Rybalov

Publication date: 23 January 2014

Published in: Groups - Complexity - Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/gcc-2013-0004

zbMATH Keywords

Diophantine equationHilbert's tenth problemgeneric complexity

Mathematics Subject Classification ID

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

Related Items (5)

Generic amplification of recursively enumerable sets ⋮ ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM ⋮ ON GENERIC UNDECIDABILITY OF HILBERT’S TENTH PROBLEM FOR POLYNOMIAL TREES ⋮ The generic complexity of the bounded problem of graphs clustering ⋮ The generic complexity of the graph triangulation problem

This page was built for publication: Generic complexity of the Diophantine problem