Inapproximability of Minimizing a Pair of DNFs or Binary Decision Trees Defining a Partial Boolean Function.
David SteinBjoern AndresPublished in: CoRR (2021)
Keyphrases
- boolean functions
- decision trees
- multi valued
- uniform distribution
- membership queries
- relevant variables
- functional properties
- decision tree induction
- binary decision diagrams
- truth table
- naive bayes
- machine learning algorithms
- decision lists
- stack filters
- approximation algorithms
- training data
- machine learning
- bi decomposition
- classification noise
- pseudo boolean functions
- polynomial size
- decision tree algorithm
- statistical queries
- decision rules
- np hard
- bayesian networks
- learning algorithm