ON GENERIC COMPLEXITY OF THE PROBLEM OF REPRESENTATION OF NATURAL NUMBERS BY SUM OF TWO SQUARES

DOI10.17223/20710410/48/8zbMath1477.11208OpenAlexW3046987661MaRDI QIDQ5151448

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/pdm707

zbMATH Keywords

sums of squaresDiophantine equationsgeneric complexity

Mathematics Subject Classification ID

Sums of squares and representations by other particular quadratic forms (11E25) Number-theoretic algorithms; complexity (11Y16) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Generic-case complexity, decision problems in group theory, and random walks.
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: ON GENERIC COMPLEXITY OF THE PROBLEM OF REPRESENTATION OF NATURAL NUMBERS BY SUM OF TWO SQUARES