Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A quadratically tight partition bound for classical communication
  complexity and query complexity   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.

31
The categories of this paper are: ao-sci
10
The categories of this paper are: q-bio
16
The categories of this paper are: stat
13
The categories of this paper are: quant-ph
15
The categories of this paper are: nucl-ex
37
The categories of this paper are: supr-con
0
The categories of this paper are: hep-ph
18
The categories of this paper are: econ
22
The categories of this paper are: chao-dyn
5
The categories of this paper are: gr-qc
34
The categories of this paper are: chem-ph
27
The categories of this paper are: comp-gas
36
The categories of this paper are: cmp-lg
3
The categories of this paper are: physics
6
The categories of this paper are: astro-ph
7
The categories of this paper are: hep-th