First Page | Document Content | |
---|---|---|
Date: 2014-04-12 03:40:34Communication 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 ListSource URL: people.cs.uchicago.eduDownload Document from Source WebsiteFile Size: 88,27 KBShare Document on Facebook |
Advanced Topics in Communication Networks Programming Network Data Planes Last week on Advanced Topics in Communication NetworksDocID: 1xVVR - View Document | |
RFCRequirements for Internet Hosts - Communication LayersDocID: 1xVVN - View Document | |
Contract Monitoring Semantics as Patterns of Communication Cameron Swords Amr Sabry Sam Tobin-HochstadtDocID: 1xVPL - View Document | |
Decoy Routing: Toward Unblockable Internet Communication Josh Karlin Daniel EllardDocID: 1xVLC - View Document | |
The Real First Class? Inferring Confidential Corporate Mergers and Government Relations from Air Traffic Communication Martin Strohmeier∗ , Matthew Smith∗ , Vincent Lenders† , Ivan Martinovic∗ ∗ University ofDocID: 1xVJm - View Document |