RUS  ENG
Full version
JOURNALS // Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics] // Archive
Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2012, Issue 2, Pages 5–10 (Mi vtpmk209)
This article is cited in 1 paper

Theoretical Foundations of Computer Science

Lower boundary of time to resolve the theory with the exponential function

A. S. Snyatkov

Tver State University, Tver

Abstract: In the paper we investigate decision time of natural number theories with addition and exponent. We show that needs at less hyperexponential time.

Keywords: arithmetical theory, computational complexity, exponent.

UDC: 510.665

Received: 23.05.2012
Revised: 25.05.2012



Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024