scientific article; zbMATH DE number 5485573

zbMath1231.68152MaRDI QIDQ5302084

Rahul Jain, Ashwin Nayak, Hartmut Klauck

Publication date: 5 January 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

A direct product theorem for two-party bounded-round public-coin communication complexity ⋮ Unnamed Item ⋮ On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity ⋮ Kolmogorov complexity and combinatorial methods in communication complexity ⋮ Simulation theorems via pseudo-random properties ⋮ New Strong Direct Product Results in Communication Complexity ⋮ The Multiparty Communication Complexity of Set Disjointness ⋮ Lifting Theorems for Equality ⋮ New bounds on classical and quantum one-way communication complexity ⋮ Communication Lower Bounds Using Directional Derivatives