Informational complexity and the direct sum problem for simultaneous message complexity

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 270-278

  Chakrabarti, A ^a   Shi, Y ^a   Wirth, A ^a   Yao, A ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; INFORMATION TECHNOLOGY; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; THEOREM PROVING;

COMMUNICATION COMPLEXITY;

SET THEORY;

EID: 0035175812     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.2001.959901     Document Type: Conference Paper

References (11)

1. Communication complexity in a 3-computer model
2. Randomized simultaneous messages
3. Communication complexity towards lower bounds on circuit depth
4. Amortized communication complexity
5. On proving super-logarithmic depth lower bounds via the direct sum in communication complexity
6. Fractional covers and communication complexity
7. Monotone circuits for connectivity require super-logarithmic depth
8. Public vs. private coin flips in one round communication games
9. Some complexity questions related to distributive computing