Uspekhi Matematicheskikh Nauk
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Subscription
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Uspekhi Mat. Nauk:
Year:
Volume:
Issue:
Page:
Find






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


Uspekhi Mat. Nauk, 1981, Volume 36, Issue 6(222), Pages 21–103 (Mi umn3102)  

This article is cited in 7 scientific papers (total in 7 papers)

Complexity problems in computational theory

A. O. Slisenko


Full text: PDF file (6212 kB)
References: PDF file   HTML file

English version:
Russian Mathematical Surveys, 1981, 36:6, 23–125

Bibliographic databases:

UDC: 518.1+519.9
MSC: 68Q15, 68Q25, 68Q30, 68Q17, 68Q42
Received: 03.03.1981

Citation: A. O. Slisenko, “Complexity problems in computational theory”, Uspekhi Mat. Nauk, 36:6(222) (1981), 21–103; Russian Math. Surveys, 36:6 (1981), 23–125

Citation in format AMSBIB
\Bibitem{Sli81}
\by A.~O.~Slisenko
\paper Complexity problems in computational theory
\jour Uspekhi Mat. Nauk
\yr 1981
\vol 36
\issue 6(222)
\pages 21--103
\mathnet{http://mi.mathnet.ru/umn3102}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=643069}
\zmath{https://zbmath.org/?q=an:0484.68034|0501.68013}
\adsnasa{http://adsabs.harvard.edu/cgi-bin/bib_query?1981RuMaS..36...23S}
\transl
\jour Russian Math. Surveys
\yr 1981
\vol 36
\issue 6
\pages 23--125
\crossref{https://doi.org/10.1070/RM1981v036n06ABEH003102}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=A1981QL14100002}


Linking options:
  • http://mi.mathnet.ru/eng/umn3102
  • http://mi.mathnet.ru/eng/umn/v36/i6/p21

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. G. Ivanov, “Recognition of an approximate occurrence of words on a Turing machine in real time”, Math. USSR-Izv., 24:3 (1985), 479–522  mathnet  crossref  mathscinet  zmath
    2. Daniele Mundici, “Tautologies with a unique craig interpolant, uniform vs. nonuniform complexity”, Annals of Pure and Applied Logic, 27:3 (1984), 265  crossref
    3. D. Yu. Grigor'ev, “The complexity of the decision problem for the first order theory of algebraically closed fields”, Math. USSR-Izv., 29:2 (1987), 459–475  mathnet  crossref  mathscinet  zmath
    4. B.F. Caviness, “Computer Algebra: Past and Future”, Journal of Symbolic Computation, 2:3 (1986), 217  crossref
    5. I. E. Shparlinski, “On some problems in the theory of finite fields”, Russian Math. Surveys, 46:1 (1991), 199–240  mathnet  crossref  mathscinet  zmath  adsnasa
    6. Etienne Grandjean, “Sorting, linear time and the satisfiability problem”, Ann Maths Artificial Intell, 16:1 (1996), 183  crossref  mathscinet  zmath  isi
    7. S. B. Gashkov, I. S. Sergeev, “Umnozhenie”, Chebyshevskii sb., 21:1 (2020), 101–134  mathnet  crossref
  • Успехи математических наук Russian Mathematical Surveys
    Number of views:
    This page:1319
    Full text:1040
    References:52
    First page:3

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021