scientific article; zbMATH DE number 6820324

DOI10.4230/LIPIcs.ICALP.2016.135zbMath1388.68119arXiv1512.01968MaRDI QIDQ4598278

Prahladh Harsha, Jaikumar Radhakrishnan, Rahul Jain

Publication date: 19 December 2017

Full work available at URL: https://arxiv.org/abs/1512.01968

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

zbMATH Keywords

communication complexityquery complexityproduct distributionpartition bound

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (1)

Quadratically tight relations for randomized query complexity

This page was built for publication: