A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
It is a very interesting and well-studied problem, given two point sets W; B < n , to design a decision tree that classi es them |that is, no leaf subdivision contains points from both B and W | and is as simple as possible, either in terms of the total number of nodes, or in terms of its depth. We show that, unless ZPP=NP, the depth of a classi er cannot be approximated within a factor smaller than 6=5, and that the total number of nodes cannot be approximated within a factor smaller than ndoi:10.1137/s009753979630814x fatcat:b6cmmmjrnnba5isggx45igdrtm