Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.]:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics], 2012, Issue 2, Pages 5–10 (Mi vtpmk209)  
This article is cited in 1 scientific paper (total 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
Citations (1)
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.
Received: 23.05.2012
Revised: 25.05.2012
Bibliographic databases:
Document Type: Article
UDC: 510.665
Language: Russian
Linking options:
  • https://www.mathnet.ru/eng/vtpmk209
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics]
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024