Sciweavers

119
Voted
COCO
2007
Springer
103views Algorithms» more  COCO 2007»
15 years 11 months ago
Bases Collapse in Holographic Algorithms
Jin-yi Cai, Pinyan Lu
COCO
2007
Springer
108views Algorithms» more  COCO 2007»
15 years 11 months ago
The Communication Complexity of Correlation
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
Prahladh Harsha, Rahul Jain, David A. McAllester, ...
126
Voted
COCO
2007
Springer
102views Algorithms» more  COCO 2007»
15 years 11 months ago
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
Ryan Williams
COCO
2007
Springer
91views Algorithms» more  COCO 2007»
15 years 11 months ago
Lower Bounds for Multi-Player Pointer Jumping
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
Amit Chakrabarti
COCO
2007
Springer
89views Algorithms» more  COCO 2007»
15 years 11 months ago
Testing Properties of Constraint-Graphs
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel T...
110
Voted
COCO
2007
Springer
90views Algorithms» more  COCO 2007»
15 years 11 months ago
Quantum versus Classical Proofs and Advice
Scott Aaronson, Greg Kuperberg