RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive
Prikl. Diskr. Mat., 2010 Number 2(8), Pages 87–95 (Mi pdm173)
This article is cited 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.

UDC: 591.1


© Steklov Math. Inst. of RAS, 2024