Standard

Informational sensitivity as algorithm’s complexity function characteristic. / Kiktenko, A.; Lunkovskiy, M.; Nikiforov, K.

Informational sensitivity as algorithm’s complexity function characteristic. 2015. стр. 450015.

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование

Harvard

Kiktenko, A, Lunkovskiy, M & Nikiforov, K 2015, Informational sensitivity as algorithm’s complexity function characteristic. в Informational sensitivity as algorithm’s complexity function characteristic. стр. 450015. https://doi.org/10.1063/1.4912674

APA

Kiktenko, A., Lunkovskiy, M., & Nikiforov, K. (2015). Informational sensitivity as algorithm’s complexity function characteristic. в Informational sensitivity as algorithm’s complexity function characteristic (стр. 450015) https://doi.org/10.1063/1.4912674

Vancouver

Kiktenko A, Lunkovskiy M, Nikiforov K. Informational sensitivity as algorithm’s complexity function characteristic. в Informational sensitivity as algorithm’s complexity function characteristic. 2015. стр. 450015 https://doi.org/10.1063/1.4912674

Author

Kiktenko, A. ; Lunkovskiy, M. ; Nikiforov, K. / Informational sensitivity as algorithm’s complexity function characteristic. Informational sensitivity as algorithm’s complexity function characteristic. 2015. стр. 450015

BibTeX

@inproceedings{f68d8a9f5c6b47b8992f72822bf0fa94,
title = "Informational sensitivity as algorithm{\textquoteright}s complexity function characteristic",
abstract = "The main goal of this study is to present technique realized with the numeric experiments, that can come to the aid in algorithm practical characterization. Input data of both varied size and varied values are considered. Informational sensitivity and confidence complexity are calculated.",
author = "A. Kiktenko and M. Lunkovskiy and K. Nikiforov",
year = "2015",
doi = "10.1063/1.4912674",
language = "English",
isbn = "9780735412873",
pages = "450015",
booktitle = "Informational sensitivity as algorithm{\textquoteright}s complexity function characteristic",

}

RIS

TY - GEN

T1 - Informational sensitivity as algorithm’s complexity function characteristic

AU - Kiktenko, A.

AU - Lunkovskiy, M.

AU - Nikiforov, K.

PY - 2015

Y1 - 2015

N2 - The main goal of this study is to present technique realized with the numeric experiments, that can come to the aid in algorithm practical characterization. Input data of both varied size and varied values are considered. Informational sensitivity and confidence complexity are calculated.

AB - The main goal of this study is to present technique realized with the numeric experiments, that can come to the aid in algorithm practical characterization. Input data of both varied size and varied values are considered. Informational sensitivity and confidence complexity are calculated.

U2 - 10.1063/1.4912674

DO - 10.1063/1.4912674

M3 - Conference contribution

SN - 9780735412873

SP - 450015

BT - Informational sensitivity as algorithm’s complexity function characteristic

ER -

ID: 3934033