Back to Results
First PageMeta Content
Communication / Communication complexity / Computational complexity theory / Quantum complexity theory / Quantum information science


Unconditional lower bounds April 12, L´ aszl´ o Babai, Noam Nisan, and Mario Szegedy. Multiparty protocols and Logspace-hard pseudorandom sequences. In Proc. 21st STOC, pages 1–11.
Add to Reading List

Document Date: 2014-04-12 03:40:34


Open Document

File Size: 88,27 KB

Share Result on Facebook