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

DOI10.17223/20710410/37/8OpenAlexW2766547341MaRDI QIDQ5151075

Alexander N. 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

zbMATH Keywords

Diophantine equationsgeneric complexity

Mathematics Subject Classification ID

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

Related Items (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

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
• Undecidable diophantine equations
• Reduction of an arbitrary diophantine equation to one in 13 unknowns

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