RUS  ENG
Full version
JOURNALS // Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki // Archive

Zh. Vychisl. Mat. Mat. Fiz., 2013 Volume 53, Number 9, Pages 1589–1600 (Mi zvmmf9923)

This article is cited in 2 papers

Algorithms using first-order neighborhoods for minimization of Boolean functions

A. V. Panov

Faculty of Computational Mathematics and Cybernetics, Moscow State University, Moscow, 119991, Russia

Abstract: A class of minimization algorithms for Boolean functions that involve conjunctions from a reduced disjunctive normal form and first-order neighborhoods of such conjunctions is investigated. A particular algorithm is selected that is the best in the class in many cases.

Key words: minimization of Boolean functions, local algorithms, information-computing algorithms, majorant algorithms.

UDC: 519.7

Received: 13.03.2013

DOI: 10.7868/S0044466913090111


 English version:
Computational Mathematics and Mathematical Physics, 2013, 53:9, 1410–1420

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026