Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






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


Problemy Peredachi Informatsii, 1966, Volume 2, Issue 1, Pages 105–108 (Mi ppi1952)  

Сorrespondence

Algorithm Determining the Maximum of a Logical Function

V. F. D'yachenko
Abstract: The maximum of a logical function over all possible combinations of values of logical variables of a certain subset is defined, and an algorithm for obtaining it without sorting through all the values is described. Equivalent relations between a logical function and its maximum which facilitate the transformation of such functions are given. There is an example of the use of the algorithm.
Received: 27.03.1965
Bibliographic databases:
Document Type: Article
UDC: 62-507
Language: Russian
Citation: V. F. D'yachenko, “Algorithm Determining the Maximum of a Logical Function”, Probl. Peredachi Inf., 2:1 (1966), 105–108; Problems Inform. Transmission, 2:1 (1966), 83–85
Citation in format AMSBIB
\Bibitem{Dya66}
\by V.~F.~D'yachenko
\paper Algorithm Determining the Maximum of a~Logical Function
\jour Probl. Peredachi Inf.
\yr 1966
\vol 2
\issue 1
\pages 105--108
\mathnet{http://mi.mathnet.ru/ppi1952}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=192955}
\transl
\jour Problems Inform. Transmission
\yr 1966
\vol 2
\issue 1
\pages 83--85
Linking options:
  • https://www.mathnet.ru/eng/ppi1952
  • https://www.mathnet.ru/eng/ppi/v2/i1/p105
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:290
    Full-text PDF :101
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024