2000
The communication complexity of enumeration, elimination, and selection
Publication
Publication
Presented at the
Annual IEEE Conference on Computational Complexity, Florence
Additional Metadata | |
---|---|
IEEE Computer Soc. (Los Alamitos, CA) | |
Annual IEEE Conference on Computational Complexity | |
Organisation | Quantum Computing and Advanced System Research |
Ambainis, A., Buhrman, H., & Gasarch, W. (2000). The communication complexity of enumeration, elimination, and selection. In Proceedings of Annual IEEE Conference on Computational Complexity 2000 (15) (pp. 44–53). IEEE Computer Soc. (Los Alamitos, CA). |