Geodesic
On generic complexity of the problem to represent natural numbers by sum of two squares
Prikladnaya Diskretnaya Matematika. Supplement, no. 13 (2020), pp. 111-113.

Voir la notice de l'article provenant de la source Math-Net.Ru

Generic-case approach to algorithmic problems was suggested by Miasnikov, Kapovich, Schupp and Shpilrain in 2003. This approach studies behavior of an algorithm on typical (almost all) inputs and ignores the rest of inputs. In this paper, we study the generic complexity of the problem to represent natural numbers by sum of two squares. This problem, going back to Fermat and Euler, is closely related to the problem of integer factorization and the quadratic residuosity problem modulo composite numbers, for which no efficient algorithms are known. We prove that under the condition of worst-case hardness and $\text{P} = \text{BPP}$, for the problem of representation of natural numbers by sum of two squares there is no polynomial strongly generic algorithm. A strongly generic algorithm solves a problem not on the whole set of inputs, but on a subset, the sequence of frequencies which with increasing size converges exponentially fast to $1$.
Keywords: generic complexity, sums of squares
Mots-clés : Diophantine equations. 
@article{PDMA_2020_13_a32,
     author = {A. N. Rybalov},
     title = {On generic complexity of the problem to represent natural numbers by sum of two squares},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {111--113},
     publisher = {mathdoc},
     number = {13},
     year = {2020},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2020_13_a32/}
}
TY  - JOUR
AU  - A. N. Rybalov
TI  - On generic complexity of the problem to represent natural numbers by sum of two squares
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2020
SP  - 111
EP  - 113
IS  - 13
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2020_13_a32/
LA  - ru
ID  - PDMA_2020_13_a32
ER  - 
%0 Journal Article
%A A. N. Rybalov
%T On generic complexity of the problem to represent natural numbers by sum of two squares
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2020
%P 111-113
%N 13
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2020_13_a32/
%G ru
%F PDMA_2020_13_a32
A. N. Rybalov. On generic complexity of the problem to represent natural numbers by sum of two squares. Prikladnaya Diskretnaya Matematika. Supplement, no. 13 (2020), pp. 111-113. http://geodesic.mathdoc.fr/item/PDMA_2020_13_a32/

[1] Dickson L. E., History of the Theory of Numbers, v. II, Dover Publications, N.Y., 2005, 803 pp. | MR

[2] Senderov V., Spivak A., “Summy kvadratov i tselye gaussovy chisla”, Kvant, 1999, no. 3, 14–22

[3] Adleman L. M., McCurley K. S., “Open problems in number theoretic complexity, II”, Proc. First Intern. Symp. Algorithmic Number Theory (N.Y., USA, May 6–9, 1994), 291–322 | MR | Zbl

[4] Kapovich I., Miasnikov A., Schupp P., Shpilrain V., “Generic-case complexity, decision problems in group theory and random walks”, J. Algebra, 264:2 (2003), 665–694 | DOI | MR | Zbl

[5] Impagliazzo R., Wigderson A., “P $=$ BPP unless E has subexponential circuits: Derandomizing the XOR Lemma”, Proc. 29th STOC., ACM, El Paso, 1997, 220–229 | MR