Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Prikladnaya Diskretnaya Matematika. Supplement, 2020, Issue 13, Pages 111–113
DOI: https://doi.org/10.17223/2226308X/13/33
(Mi pdma513)
 

Mathematical Foundations of Informatics and Programming

On generic complexity of the problem to represent natural numbers by sum of two squares

A. N. Rybalov

Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
References:
Abstract: 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, Diophantine equations.
Document Type: Article
UDC: 510.52
Language: Russian
Citation: A. N. Rybalov, “On generic complexity of the problem to represent natural numbers by sum of two squares”, Prikl. Diskr. Mat. Suppl., 2020, no. 13, 111–113
Citation in format AMSBIB
\Bibitem{Ryb20}
\by A.~N.~Rybalov
\paper On generic complexity of the problem to represent natural numbers by sum of two squares
\jour Prikl. Diskr. Mat. Suppl.
\yr 2020
\issue 13
\pages 111--113
\mathnet{http://mi.mathnet.ru/pdma513}
\crossref{https://doi.org/10.17223/2226308X/13/33}
Linking options:
  • https://www.mathnet.ru/eng/pdma513
  • https://www.mathnet.ru/eng/pdma/y2020/i13/p111
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Prikladnaya Diskretnaya Matematika. Supplement
    Statistics & downloads:
    Abstract page:81
    Full-text PDF :49
    References:14
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024