ON GENERIC UNDECIDABILITY OF HILBERT’S TENTH PROBLEM FOR POLYNOMIAL TREES

DOI10.17223/20710410/44/8zbMath1466.11095OpenAlexW2964022115MaRDI QIDQ5151267

Alexander N. Rybalov

Publication date: 17 February 2021

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm664

zbMATH Keywords

Diophantine equationsgeneric complexity

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Decidability of theories and sets of sentences (03B25) Diophantine equations (11D99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Diophantine cryptography in free metabelian groups: theoretical base.
• Generic-case complexity, decision problems in group theory, and random walks.
• Generic complexity of the Diophantine problem
• ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM

This page was built for publication: ON GENERIC UNDECIDABILITY OF HILBERT’S TENTH PROBLEM FOR POLYNOMIAL TREES