First Page | Document Content | |
---|---|---|
Date: 2006-09-25 10:55:42Cryptography Mathematical analysis Quantum complexity theory Computational complexity theory Functions and mappings Secure multi-party computation Communication complexity Secure two-party computation Limit of a function Cryptographic protocol Pi PP | Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. StrausskAdd to Reading ListSource URL: cs-www.cs.yale.eduDownload Document from Source WebsiteFile Size: 411,92 KBShare Document on Facebook |
Large Bell violations from communication complexity lower bounds Gabriel Senno Joint work with with S. Laplante, M. Laurière, A. Nolin (IRIF), J. Roland (ULB)DocID: 1vn3Y - View Document | |
The communication complexity of addition Emanuele Viola∗ December 12, 2013 Abstract Suppose each of k ≤ no(1)DocID: 1uYzp - View Document | |
Communication Complexity for Distributed Graphs Qin Zhang Indiana University BloomingtonDocID: 1uTYi - View Document | |
The multiparty communication complexity of interleaved group products W. T. Gowers∗ Emanuele Viola†DocID: 1uPys - View Document | |
1 Fundamental limits on complexity and power consumption in coded communication Pulkit Grover† , Andrea Goldsmith† , Anant Sahai‡ † Stanford University ‡ University of California, BerkeleyDocID: 1uKNv - View Document |