Critical Properties and Complexity Measures of Read-Once Boolean Functions

Abstract
In 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.

Citation
Lozin, V., & Moshkov, M. (2021). Critical Properties and Complexity Measures of Read-Once Boolean Functions. Annals of Mathematics and Artificial Intelligence. doi:10.1007/s10472-021-09734-6

Acknowledgements
Research reported in this publication was supported by the King Abdullah University of Science and Technology (KAUST).

Publisher
Springer Nature

Journal
Annals of Mathematics and Artificial Intelligence

DOI
10.1007/s10472-021-09734-6

Additional Links
http://link.springer.com/10.1007/s10472-021-09734-6

Permanent link to this record