Joint work with Daniel Kane (UCSD) and Shachar Lovett (UCSD)
We construct near optimal linear decision trees for a variety of
decision problems in combinatorics and discrete geometry.
For example, for any constant $k$, we construct linear
decision...