Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Computational Trichotomy for Connectivity of Boolean Satisfiability   For Boolean satisfiability problems, the structure of the solution space is
characterized by the solution graph, where the vertices are the solutions, and
two solutions are connected iff they differ in exactly one variable. In 2006,
Gopalan et al. studied connectivity properties of the solution graph and
related complexity issues for CSPs, motivated mainly by research on
satisfiability algorithms and the satisfiability threshold. They proved
dichotomies for the diameter of connected components and for the complexity of
the st-connectivity question, and conjectured a trichotomy for the connectivity
question.
  Building on this work, we here prove the trichotomy: Connectivity is either
in P, coNP-complete, or PSPACE-complete. Also, we correct a minor mistake of
Gopalan et al., which leads to a slight shift of the boundaries towards the
hard side.

11
The categories of this paper are: hep-lat
24
The categories of this paper are: dg-ga
36
The categories of this paper are: cmp-lg
18
The categories of this paper are: econ
20
The categories of this paper are: acc-phys
37
The categories of this paper are: supr-con
22
The categories of this paper are: chao-dyn
27
The categories of this paper are: comp-gas
3
The categories of this paper are: physics
25
The categories of this paper are: patt-sol
19
The categories of this paper are: eess
29
The categories of this paper are: funct-an
8
The categories of this paper are: hep-ex
13
The categories of this paper are: quant-ph
6
The categories of this paper are: astro-ph
32
The categories of this paper are: atom-ph