On the Minimization of Boolean Functions for Additive Complexity Measures

2019 ◽  
Vol 13 (3) ◽  
pp. 418-435
Author(s):  
I. P. Chukhrov
Keyword(s):  
Boolean Functions ◽  
Complexity Measures ◽  
Minimization Of Boolean Functions ◽  
Additive Complexity

Minimization of boolean functions and effective recognition algorithms

Cybernetics ◽  
1975 ◽  
Vol 10 (3) ◽  
pp. 393-397 ◽  
Author(s):  
I. B. Gurevich ◽  
Yu. I. Zhuravlev
Keyword(s):  
Boolean Functions ◽  
Recognition Algorithms ◽  
Minimization Of Boolean Functions

scholarly journals Critical Properties and Complexity Measures of Read-Once Boolean Functions

2021 ◽  
Author(s):  
Vadim Lozin ◽  
Mikhail Moshkov
Keyword(s):  
Boolean Functions ◽  
Critical Properties ◽  
Complexity Measures ◽  
Well Quasi Order ◽  
Finite Set ◽  
Quasi Order ◽  
Parameter Measuring ◽  
Two Parameters

AbstractIn this paper, we define a quasi-order on the set of read-once Boolean functions and show that this is a well-quasi-order. This implies that every parameter measuring complexity of the functions can be characterized by a finite set of minimal subclasses of read-once functions, where this parameter is unbounded. We focus on two parameters related to certificate complexity and characterize each of them in the terminology of minimal classes.

Sign in / Sign up

Export Citation Format

Share Document