Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Cohomology in Grothendieck Topologies and Lower Bounds in Boolean
  Complexity II: A Simple Example   In a previous paper we have suggested a number of ideas to attack circuit
size complexity with cohomology. As a simple example, we take circuits that can
only compute the AND of two inputs, which essentially reduces to SET COVER. We
show a very special case of the cohomological approach (one particular free
category, using injective and superskyscraper sheaves) gives the linear
programming bound coming from the relaxation of the standard integer
programming reformulation of SET COVER.

14
The categories of this paper are: math-ph
35
The categories of this paper are: mtrl-th
16
The categories of this paper are: stat
7
The categories of this paper are: hep-th
37
The categories of this paper are: supr-con
26
The categories of this paper are: bayes-an
32
The categories of this paper are: atom-ph
30
The categories of this paper are: q-alg
5
The categories of this paper are: gr-qc
34
The categories of this paper are: chem-ph
8
The categories of this paper are: hep-ex
11
The categories of this paper are: hep-lat
33
The categories of this paper are: plasm-ph
0
The categories of this paper are: hep-ph
4
The categories of this paper are: cond-mat
6
The categories of this paper are: astro-ph