Learning read-once formulas with queries
Journal of the ACM (JACM)
On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Factoring logic functions using graph partitioning
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Factoring and recognition of read-once functions using cographs and normality
Proceedings of the 38th annual Design Automation Conference
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
A simple linear time algorithm for cograph recognition
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Factoring boolean functions using graph partitioning
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Sans constraints? feature diagrams vs. feature models
SPLC'10 Proceedings of the 14th international conference on Software product lines: going beyond
On exact blockers and anti-blockers, Δ-conjecture, and related problems
Discrete Applied Mathematics
Efficient method to compute minimum decision chains of Boolean functions
Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI
Aggregation in probabilistic databases via knowledge compilation
Proceedings of the VLDB Endowment
Factorised representations of query results: size bounds and readability
Proceedings of the 15th International Conference on Database Theory
Efficient transistor-level design of CMOS gates
Proceedings of the 23rd ACM international conference on Great lakes symposium on VLSI
| Hi-index | 0.04 |
Read-once functions have gained recent, renewed interest in the fields of theory and algorithms of Boolean functions, computational learning theory and logic design and verification. In an earlier paper [M.C. Golumbic, A. Mintz, U. Rotics, Factoring and recognition of read-once functions using cographs and normality, and the readability of functions associated with partial k-trees, Discrete Appl. Math. 154 (2006) 1465-1677], we presented the first polynomial-time algorithm for recognizing and factoring read-once functions, based on a classical characterization theorem of Gurvich which states that a positive Boolean function is read-once if and only if it is normal and its co-occurrence graph is P"4-free. In this note, we improve the complexity bound by showing that the method can be modified slightly, with two crucial observations, to obtain an O(n|f|) implementation, where |f| denotes the length of the DNF expression of a positive Boolean function f, and n is the number of variables in f. The previously stated bound was O(n^2k), where k is the number of prime implicants of the function. In both cases, f is assumed to be given as a DNF formula consisting entirely of the prime implicants of the function.