scientific article; zbMATH DE number 1954386
From MaRDI portal
Publication:4415257
zbMath1027.68065MaRDI QIDQ4415257
Pranab Sen, Jaikumar Radhakrishnan, Rahul Jain
Publication date: 28 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2556/25560218.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Quantum computation (81P68) Measures of information, entropy (94A17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
A direct product theorem for two-party bounded-round public-coin communication complexity ⋮ Unnamed Item ⋮ New Strong Direct Product Results in Communication Complexity
This page was built for publication:
