Complexity and elasticity of the computation

Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций

Год издания: 2010

Ключевые слова: Computation complexity, Software, Asymptotic behaviour, Elasticity function, Hyperexponential, Algorithms, Asymptotic analysis, Automation, Computer software, Information technology, Theorem proving, Elasticity

Аннотация: 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.

Ссылки на полный текст

Издание

Журнал: Proceedings of the IASTED International Conference on Automation, Control, and Information Technology - Control, Diagnostics, and Automation, ACIT-CDA 2010

Номера страниц: 334-340

Персоны

Bykova V.V. (Institute of Mathematics,Siberian Federal University)

Вхождение в базы данных

Информация о публикациях загружается с сайта службы поддержки публикационной активности СФУ. Сообщите, если заметили неточности.