Doklady Akademii Nauk SSSR
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find




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

Doklady Akademii Nauk SSSR, 1962, Volume 145, Number 1, Pages 48–51 (Mi dan26685)  
This article is cited in 2 scientific papers (total in 3 papers)

CYBERNETICS AND THE REGULATION THEORY

On the algorithmic complexity of discrete functions

Yu. Ofman
Full-text PDF (544 kB) Citations (3)
Presented: A. N. Kolmogorov
Received: 09.02.1962
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: Yu. Ofman, “On the algorithmic complexity of discrete functions”, Dokl. Akad. Nauk SSSR, 145:1 (1962), 48–51
Citation in format AMSBIB
\Bibitem{Ofm62}
\by Yu.~Ofman
\paper On the algorithmic complexity of discrete functions
\jour Dokl. Akad. Nauk SSSR
\yr 1962
\vol 145
\issue 1
\pages 48--51
\mathnet{http://mi.mathnet.ru/dan26685}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=0168423}
\zmath{https://zbmath.org/?q=an:0132.24803}
Linking options:
  • https://www.mathnet.ru/eng/dan26685
  • https://www.mathnet.ru/eng/dan/v145/i1/p48
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025