Complexity and Elasticity of the Computation

V.V. Bykova (Russia)


Software, computation complexity


We offer a new indication to recognize the algorithms classes which is based on the asymptotic behaviour of elasticity functions complexity. The theorem that states the characterization of elasticity for rapid, polynomial, subexponential, exponential and hyperexponential algorithms has been proved. The principal advantage of the suggested indication is that it allows the simplicity of computation caused by the well-known properties of elasticity.

Important Links:

Go Back