Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Minimization for Generalized Boolean Formulas   The minimization problem for propositional formulas is an important
optimization problem in the second level of the polynomial hierarchy. In
general, the problem is Sigma-2-complete under Turing reductions, but
restricted versions are tractable. We study the complexity of minimization for
formulas in two established frameworks for restricted propositional logic: The
Post framework allowing arbitrarily nested formulas over a set of Boolean
connectors, and the constraint setting, allowing generalizations of CNF
formulas. In the Post case, we obtain a dichotomy result: Minimization is
solvable in polynomial time or coNP-hard. This result also applies to Boolean
circuits. For CNF formulas, we obtain new minimization algorithms for a large
class of formulas, and give strong evidence that we have covered all
polynomial-time cases.

33
The categories of this paper are: plasm-ph
28
The categories of this paper are: alg-geom
27
The categories of this paper are: comp-gas
5
The categories of this paper are: gr-qc
34
The categories of this paper are: chem-ph
25
The categories of this paper are: patt-sol
26
The categories of this paper are: bayes-an
11
The categories of this paper are: hep-lat
32
The categories of this paper are: atom-ph
30
The categories of this paper are: q-alg
37
The categories of this paper are: supr-con
20
The categories of this paper are: acc-phys
31
The categories of this paper are: ao-sci
18
The categories of this paper are: econ
10
The categories of this paper are: q-bio
3
The categories of this paper are: physics