Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Block Interpolation: A Framework for Tight Exponential-Time Counting
  Complexity   We devise a framework for proving tight lower bounds under the counting
exponential-time hypothesis #ETH introduced by Dell et al. (ACM Transactions on
Algorithms, 2014). Our framework allows us to convert classical #P-hardness
results for counting problems into tight lower bounds under #ETH, thus ruling
out algorithms with running time $2^{o(n)}$ on graphs with $n$ vertices and
$O(n)$ edges. As exemplary applications of this framework, we obtain tight
lower bounds under #ETH for the evaluation of the zero-one permanent, the
matching polynomial, and the Tutte polynomial on all non-easy points except for
one line. This remaining line was settled very recently by Brand et al. (IPEC
2016).

33
The categories of this paper are: plasm-ph
18
The categories of this paper are: econ
5
The categories of this paper are: gr-qc
15
The categories of this paper are: nucl-ex
37
The categories of this paper are: supr-con
16
The categories of this paper are: stat
29
The categories of this paper are: funct-an
27
The categories of this paper are: comp-gas
24
The categories of this paper are: dg-ga
17
The categories of this paper are: q-fin
32
The categories of this paper are: atom-ph
26
The categories of this paper are: bayes-an
19
The categories of this paper are: eess
6
The categories of this paper are: astro-ph
20
The categories of this paper are: acc-phys
25
The categories of this paper are: patt-sol