Inapproximability of Minimizing a Pair of DNFs or Binary Decision Trees Defining a Partial Boolean Function

Add code
Mar 03, 2021
Figure 1 for Inapproximability of Minimizing a Pair of DNFs or Binary Decision Trees Defining a Partial Boolean Function
Figure 2 for Inapproximability of Minimizing a Pair of DNFs or Binary Decision Trees Defining a Partial Boolean Function

Share this with someone who'll enjoy it:

View paper onarxiv icon

Share this with someone who'll enjoy it: