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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



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






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


Prikl. Diskr. Mat., 2020, Number 48, Pages 93–99 (Mi pdm707)  

This article is cited in 1 scientific paper (total in 1 paper)

Mathematical Backgrounds of Informatics and Programming

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

A. N. Rybalov

Sobolev Institute of Mathematics, Omsk, Russia

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 of representation of 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 $P = 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. To prove this theorem we use the method of generic amplification, which allows to construct generically hard problems from the problems hard in the classical sense. The main ingredient of this method is a technique of cloning, which unites inputs of the problem together in the large enough sets of equivalent inputs. Equivalence is understood in the sense that the problem is solved similarly for them.

Keywords: generic complexity, sums of squares, Diophantine equations.

Funding Agency Grant Number
Siberian Branch of Russian Academy of Sciences I.1.1.4, проект № 0314-2019-0004


DOI: https://doi.org/10.17223/20710410/48/8

Full text: PDF file (663 kB)
References: PDF file   HTML file

Bibliographic databases:

UDC: 510.52

Citation: A. N. Rybalov, “On generic complexity of the problem of representation of natural numbers by sum of two squares”, Prikl. Diskr. Mat., 2020, no. 48, 93–99

Citation in format AMSBIB
\Bibitem{Ryb20}
\by A.~N.~Rybalov
\paper On generic complexity of the problem of~representation of natural numbers by~sum~of~two~squares
\jour Prikl. Diskr. Mat.
\yr 2020
\issue 48
\pages 93--99
\mathnet{http://mi.mathnet.ru/pdm707}
\crossref{https://doi.org/10.17223/20710410/48/8}


Linking options:
  • http://mi.mathnet.ru/eng/pdm707
  • http://mi.mathnet.ru/eng/pdm/y2020/i2/p93

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. V. Seliverstov, “Dvoichnye resheniya dlya bolshikh sistem lineinykh uravnenii”, PDM, 2021, no. 52, 5–15  mathnet  crossref
  • Прикладная дискретная математика
    Number of views:
    This page:59
    Full text:18
    References:4

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021