Minimum self-dual decompositions of positive dual-minor Boolean functions

Authors:
Jan C. Bioch;Toshihide Ibaraki;Kazuhisa Makino
Affiliations:
-;-;-
Venue:
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Year:
1999

Citing 0
Cited 4

The complexity of modular decomposition of boolean functions

Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Counting and enumerating aggregate classifiers

Discrete Applied Mathematics
The complexity of modular decomposition of Boolean functions

Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
A stronger LP bound for formula size lower bounds via clique constraints

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract