ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM

DOI10.17223/20710410/37/8MaRDI QIDQ5151075zbMATH OpenOpenAlexFDO

Authors Alexander Rybalov

Publication date 16 February 2021

Published in Prikladnaya diskretnaya matematika (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/pdm595, https://semanticscholar.org/paper/c8e759c753fdc9f093404592f2bda8da16e0e631

zbMATH Keywords

Diophantine equationsgeneric complexity

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Recommendations

• Generic complexity of the Diophantine problem
• On generic undecidability of Hilbert's tenth problem for polynomial trees
• On the complexity of Diophantine geometry in low dimensions (extended abstract)
• On generic complexity of the discrete logarithm problem
• The bounds of Skolem functions and their applications

Cites work

• Diophantine cryptography in free metabelian groups: theoretical base.
• Diophantine cryptography over infinite groups
• Generic complexity of the Diophantine problem
• Generic-case complexity, decision problems in group theory, and random walks.
• scientific article; zbMATH DE number 3336816 (Why is no real title available?)
• scientific article; zbMATH DE number 3029480 (Why is no real title available?)
• Reduction of an arbitrary diophantine equation to one in 13 unknowns
• Undecidable diophantine equations

Cited in

(3)

• Symmetric matrices whose entries are linear functions
• On generic undecidability of Hilbert's tenth problem for polynomial trees
• On binary solutions to systems of equations

This page was built for publication: ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM

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