<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2007-01-08 22:02:22Decision tree model Randomized algorithm NP PP P versus NP problem Certificate Aanderaa–Karp–Rosenberg conjecture Communication complexity Theoretical computer science Applied mathematics Computational complexity theory |
| 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 |