On the generic complexity of solving equations over natural numbers with addition

DOI10.17223/20710410/64/6MaRDI QIDQ6573401zbMATH OpenFDO

Authors Alexander Rybalov

Publication date 16 July 2024

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

zbMATH Keywords

linear equationsnatural numbersgeneric complexity

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• Algebraic geometry over natural numbers. The classification of coordinate monoids.
• Compatibility of systems of linear constraints over the set of natural numbers
• Generic complexity of the Diophantine problem
• Generic-case complexity, decision problems in group theory, and random walks.
• Random equations in free groups.
• Random equations in nilpotent groups.

This page was built for publication: On the generic complexity of solving equations over natural numbers with addition

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