RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
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., 2010, Number 2(8), Pages 87–95 (Mi pdm173)  

This article is cited in 4 scientific papers (total in 4 papers)

Mathematical Foundations of Informatics and Programming

Elasticity of algorithms

V. V. Bykova

Institute of Mathematics, Siberian Federal University, Krasnoyarsk, Russia

Abstract: We present the characterization of elasticity for rapid, polynomial, subexponential, exponential and hyperexponential algorithms. We give a method for comparing algorithms by their elasticity.

Keywords: computation complexity, algorithms analysis.

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

UDC: 591.1

Citation: V. V. Bykova, “Elasticity of algorithms”, Prikl. Diskr. Mat., 2010, no. 2(8), 87–95

Citation in format AMSBIB
\Bibitem{Byk10}
\by V.~V.~Bykova
\paper Elasticity of algorithms
\jour Prikl. Diskr. Mat.
\yr 2010
\issue 2(8)
\pages 87--95
\mathnet{http://mi.mathnet.ru/pdm173}


Linking options:
  • http://mi.mathnet.ru/eng/pdm173
  • http://mi.mathnet.ru/eng/pdm/y2010/i2/p87

    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
    Cycle of papers

    This publication is cited in the following articles:
    1. V. V. Bykova, “FPT-algoritmy i ikh klassifikatsiya na osnove elastichnosti”, PDM, 2011, no. 2(12), 40–48  mathnet
    2. V. V. Bykova, “FTP-algoritmy i ikh klassifikatsiya na osnove elastichnosti”, PDM, 2011, prilozhenie № 4, 58–60  mathnet
    3. V. V. Bykova, “Ob asimptotike reshenii rekurrentnykh sootnoshenii v analize algoritmov rasschepleniya dlya propozitsionalnoi vypolnimosti”, PDM. Prilozhenie, 2013, no. 6, 112–116  mathnet
    4. V. V. Bykova, “Ob asimptotike reshenii rekurrentnykh sootnoshenii spetsialnogo vida i tekhnike Kulmana–Lyukkhardta”, PDM, 2013, no. 4(22), 56–66  mathnet
  • Прикладная дискретная математика
    Number of views:
    This page:493
    Full text:374
    References:264
    First page:1

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2017