We prove that it is NP-hard to properly PAC learn decision trees with
qu...
We prove a strong composition theorem for junta complexity and show how ...
In the certification problem, the algorithm is given a function f with
c...
We establish new hardness results for decision tree optimization problem...
share