Pith. sign in

REVIEW

A quadratically tight partition bound for classical communication complexity and query complexity

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1401.4512 v1 pith:52Y7IXK2 submitted 2014-01-18 cs.CC

Rahul Jain , Troy Lee , Nisheeth K. Vishnoi This is my paper · ORCID
classification cs.CC
keywords complexityboundcommunicationquerypartitionclassicalpublic-coinquadratically
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this work we introduce, both for classical communication complexity and query complexity, a modification of the 'partition bound' introduced by Jain and Klauck [2010]. We call it the 'public-coin partition bound'. We show that (the logarithm to the base two of) its communication complexity and query complexity versions form, for all relations, a quadratically tight lower bound on the public-coin randomized communication complexity and randomized query complexity respectively.

Discussion (0). Continue with ORCID to comment.

Pith tools