scientific article; zbMATH DE number 1559552

MaRDI QIDQ4527004zbMATH OpenFDO

Authors Itzhak Parnafes, Ran Raz, A. Wigderson

Publication date 28 February 2001

zbMATH Keywords

communication complexity model

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• A direct product theorem for two-party bounded-round public-coin communication complexity
• scientific article; zbMATH DE number 1769898
• A Parallel Repetition Theorem
• New strong direct product results in communication complexity
• Direct product via round-preserving compression

Cited in

(6)

• New strong direct product results in communication complexity
• A direct product theorem for two-party bounded-round public-coin communication complexity
• Derandomized parallel repetition theorems for free games
• Parallel repetition of two-prover one-round games: an exposition
• Parallel Repetition of the Odd Cycle Game
• Choosing, agreeing, and eliminating in communication complexity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527004)