Pages that link to "Item:Q3745767"

The following pages link to On the complexity of shortest disjunctive normal forms of Boolean functions (Q3745767):

Displaying 2 items.

• Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms (Q5413210) (← links)
• An upper bound for complexity of polynomial normal forms of Boolean functions (Q5704311) (← links)