The communication complexity of enumeration, elimination, and selection

2001

Presented at the Annual IEEE Conference on Computational Complexity, Florence

Additional Metadata
MSC	Complexity classes (hierarchies, relations among complexity classes, etc.) (msc 68Q15), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (msc 68Q10)
Publisher	Springer
Journal	Journal of Computer Science and Technology
Conference	Annual IEEE Conference on Computational Complexity
Note	Special issue: Complexity 2000 (Florence)
Organisation	Quantum Computing and Advanced System Research
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Ambainis, A., Buhrman, H., Gasarch, W., Kalyanasundaram, B., & Torenvliet, L. (2001). The communication complexity of enumeration, elimination, and selection. In Journal of Computer Science and Technology (Vol. 63, pp. 148–185). Springer.

Publication