On lower bounds for the complexity of disjunctive normal forms of Boolean functions with a small number of zeros
Authors:
A. Yu. Kogan
Affiliations:
-
Venue:
USSR Computational Mathematics and Mathematical Physics
Year:
1989
Citing
0
Cited
1
The DNF exception problem
Theoretical Computer Science
Quantified Score
Hi-index
0.00
Visualization
Abstract