Informational complexity and the direct sum problem for simultaneous message complexity
Year: 2001
Type: conference-paper
Authors: A. Chakrabarti, Yaoyun Shi, A. Wirth, A. Yao
Institution: Princeton University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W2114607430
