Login / Signup
Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent.
Penghui Yao
Published in:
CoRR (2015)
Keyphrases
</>
decision trees
computational complexity
decision problems
communication systems
database
wireless sensor networks
computational cost
worst case
space complexity
communication technologies
polynomial size