A Low-Depth Monotone Function that is not an Approximate Junta [article]

Daniel M. Kane
2013 arXiv   pre-print
We provide an example of a monotone Boolean function on the hypercube given by a low depth decision tree that is not well approximated by any k-junta for small k.
arXiv:1206.6541v2 fatcat:voadm5hhpfhgdngfmhn2ayntfa