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

DOI10.17223/20710410/64/6MaRDI QIDQ6573401FDOQ6573401

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

• Title not available (Why is that?)
• Generic-case complexity, decision problems in group theory, and random walks.
• Random equations in free groups.
• Random equations in nilpotent groups.
• Algebraic geometry over natural numbers. The classification of coordinate monoids.
• Generic complexity of the Diophantine problem
• Compatibility of systems of linear constraints over the set of natural numbers

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)