RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 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.

UDC: 62-507

Received: 27.03.1965


 English version:
Problems of Information Transmission, 1966, 2:1, 83–85

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024