Login / Signup
Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent.
Penghui Yao
Published in:
Chic. J. Theor. Comput. Sci. (2016)
Keyphrases
</>
decision trees
computational complexity
predictive accuracy
case study
real time
machine learning
bayesian networks
multi class
worst case