D. Burago, Y. Burago, and S. Ivanov, A Course in Metric Geometry, Graduate Studies in Mathematics. Americal Mathematical Society, vol.33, 2001.
DOI : 10.1090/gsm/033

M. Fischer and M. Rabin, Super-Exponential Complexity of Presburger Arithmetic, Complexity of Computation, SIAM-ASM Proceedings, pp.27-41, 1974.
DOI : 10.1007/978-3-7091-9459-1_5

Y. Gurevich, Evolving algebra 1993: Lipari guide, Specification and Validation Methods, pp.9-93, 1995.

A. N. Kolmogorov, On the Logical Foundations of Information Theory and Probability Theory In Russian. English translation in: Problems of Information Transmission, Selected Works of A.N. Kolmogorov: Volume III: Information Theory and the Theory of Algorithms (Mathematics and its Applications), pp.3-7, 1969.

A. N. Kolmogorov and V. M. Tikhomirov, ?-entropy and ?-capacity of sets in function spaces, Uspekhi Mat. Nauk Russian. English translation in: Selected Works of A.N. Kolmogorov: Volume III: Information Theory and the Theory of Algorithms (Mathematics and its Applications), pp.3-86, 1959.

O. B. Lupanov, The synthesis of contact circuits, Dokl. Akad.Nauk SSSR, vol.119, pp.23-26, 1958.

N. F. Martin and J. W. England, Mathematical Theory of Entropy, 1981.
DOI : 10.1017/cbo9781107340718

V. A. Rokhlin, LECTURES ON THE ENTROPY THEORY OF MEASURE-PRESERVING TRANSFORMATIONS, Russian Mathematical Surveys, vol.22, issue.5, pp.1-52, 1967.
DOI : 10.1070/RM1967v022n05ABEH001224

C. Shannon, The Synthesis of Two-Terminal Switching Circuits, Bell System Technical Journal, vol.28, issue.1, pp.59-98, 1949.
DOI : 10.1002/j.1538-7305.1949.tb03624.x

A. Slissenko, Complexity problems in computational theory, Russian original in: Uspekhi Matem. Nauk, pp.23-12521, 1981.
DOI : 10.1070/RM1981v036n06ABEH003102

A. Slissenko, On measures of information quality of knowledge processing systems, Information Sciences, vol.57, issue.58, pp.57-58389, 1991.
DOI : 10.1016/0020-0255(91)90089-D

A. Slissenko, On Entropy in Computations Organized by National Academy of Science of Armenia, Proc. of the 8th Intern. Conf. on Computer Science and Information Technology (CSIT'2011), pp.25-30, 2011.

D. A. Spielman and S. Teng, Smoothed analysis of algorithms, Journal of the ACM, vol.51, issue.3, pp.385-463, 2004.
DOI : 10.1145/990308.990310
URL : http://arxiv.org/pdf/math/0212413