RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Subscription
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Izv. RAN. Ser. Mat.:
Year:
Volume:
Issue:
Page:
Find






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


Izv. Akad. Nauk SSSR Ser. Mat., 1967, Volume 31, Issue 1, Pages 161–208 (Mi izv2534)  

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

Normal algorithms connected with the computation of boolean functions

A. A. Markov


Abstract: The article deals with lower and upper bounds for the complexity of normal algorithms related to the computation of Boolean functions.

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

English version:
Mathematics of the USSR-Izvestiya, 1967, 1:1, 151–194

Bibliographic databases:

UDC: 51.01.16
MSC: 03G05, 65Y20, 65Dxx
Received: 29.09.1966

Citation: A. A. Markov, “Normal algorithms connected with the computation of boolean functions”, Izv. Akad. Nauk SSSR Ser. Mat., 31:1 (1967), 161–208; Math. USSR-Izv., 1:1 (1967), 151–194

Citation in format AMSBIB
\Bibitem{Mar67}
\by A.~A.~Markov
\paper Normal algorithms connected with the computation of boolean functions
\jour Izv. Akad. Nauk SSSR Ser. Mat.
\yr 1967
\vol 31
\issue 1
\pages 161--208
\mathnet{http://mi.mathnet.ru/izv2534}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=210587}
\zmath{https://zbmath.org/?q=an:0148.24803|0164.31803}
\transl
\jour Math. USSR-Izv.
\yr 1967
\vol 1
\issue 1
\pages 151--194
\crossref{https://doi.org/10.1070/IM1967v001n01ABEH000552}


Linking options:
  • http://mi.mathnet.ru/eng/izv2534
  • http://mi.mathnet.ru/eng/izv/v31/i1/p161

    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. K. Zvonkin, L. A. Levin, “The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms”, Russian Math. Surveys, 25:6 (1970), 83–124  mathnet  crossref  mathscinet  zmath
    2. P. Vitani, M. Li, “Kolmogorovskaya slozhnost: dvadtsat let spustya”, UMN, 43:6(264) (1988), 129–166  mathnet  mathscinet  zmath
    3. “Andrei Andreevich Markov (on the centenary of his birth)”, Discrete Math. Appl., 14:1 (2004), 1–6  mathnet  crossref  crossref  mathscinet
  • Известия Академии наук СССР. Серия математическая Izvestiya: Mathematics
    Number of views:
    This page:376
    Full text:110
    References:27
    First page:1

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019