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, 1971, Volume 198, Number 1, Pages 35–38 (Mi dan36133)  
MATHEMATICS

On complexity of Boolean function minimization

M. I. Kanovitch

Lomonosov Moscow State University
Full-text PDF (579 kB)
Presented: P. S. Novikov
Received: 22.10.1970
Bibliographic databases:
Document Type: Article
UDC: 517.11:518.5
Language: Russian
Citation: M. I. Kanovitch, “On complexity of Boolean function minimization”, Dokl. Akad. Nauk SSSR, 198:1 (1971), 35–38
Citation in format AMSBIB
\Bibitem{Kan71}
\by M.~I.~Kanovitch
\paper On complexity of Boolean function minimization
\jour Dokl. Akad. Nauk SSSR
\yr 1971
\vol 198
\issue 1
\pages 35--38
\mathnet{http://mi.mathnet.ru/dan36133}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=0281619}
\zmath{https://zbmath.org/?q=an:0235.02026}
Linking options:
  • https://www.mathnet.ru/eng/dan36133
  • https://www.mathnet.ru/eng/dan/v198/i1/p35
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:82
    Full-text PDF :37
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024