825 research outputs found
Holographic Algorithm with Matchgates Is Universal for Planar CSP Over Boolean Domain
We prove a complexity classification theorem that classifies all counting
constraint satisfaction problems (CSP) over Boolean variables into exactly
three categories: (1) Polynomial-time tractable; (2) P-hard for general
instances, but solvable in polynomial-time over planar graphs; and (3)
P-hard over planar graphs. The classification applies to all sets of local,
not necessarily symmetric, constraint functions on Boolean variables that take
complex values. It is shown that Valiant's holographic algorithm with
matchgates is a universal strategy for all problems in category (2).Comment: 94 page
Even Delta-Matroids and the Complexity of Planar Boolean CSPs
The main result of this paper is a generalization of the classical blossom
algorithm for finding perfect matchings. Our algorithm can efficiently solve
Boolean CSPs where each variable appears in exactly two constraints (we call it
edge CSP) and all constraints are even -matroid relations (represented
by lists of tuples). As a consequence of this, we settle the complexity
classification of planar Boolean CSPs started by Dvorak and Kupec.
Using a reduction to even -matroids, we then extend the tractability
result to larger classes of -matroids that we call efficiently
coverable. It properly includes classes that were known to be tractable before,
namely co-independent, compact, local, linear and binary, with the following
caveat: we represent -matroids by lists of tuples, while the last two
use a representation by matrices. Since an matrix can represent
exponentially many tuples, our tractability result is not strictly stronger
than the known algorithm for linear and binary -matroids.Comment: 33 pages, 9 figure
Polynomial-time Solvable #CSP Problems via Algebraic Models and Pfaffian Circuits
A Pfaffian circuit is a tensor contraction network where the edges are
labeled with changes of bases in such a way that a very specific set of
combinatorial properties are satisfied. By modeling the permissible changes of
bases as systems of polynomial equations, and then solving via computation, we
are able to identify classes of 0/1 planar #CSP problems solvable in
polynomial-time via the Pfaffian circuit evaluation theorem (a variant of L.
Valiant's Holant Theorem). We present two different models of 0/1 variables,
one that is possible under a homogeneous change of basis, and one that is
possible under a heterogeneous change of basis only. We enumerate a series of
1,2,3, and 4-arity gates/cogates that represent constraints, and define a class
of constraints that is possible under the assumption of a ``bridge" between two
particular changes of bases. We discuss the issue of planarity of Pfaffian
circuits, and demonstrate possible directions in algebraic computation for
designing a Pfaffian tensor contraction network fragment that can simulate a
swap gate/cogate. We conclude by developing the notion of a decomposable
gate/cogate, and discuss the computational benefits of this definition
Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems
A complete classification of the computational complexity of the fixed-point
existence problem for boolean dynamical systems, i.e., finite discrete
dynamical systems over the domain {0, 1}, is presented. For function classes F
and graph classes G, an (F, G)-system is a boolean dynamical system such that
all local transition functions lie in F and the underlying graph lies in G. Let
F be a class of boolean functions which is closed under composition and let G
be a class of graphs which is closed under taking minors. The following
dichotomy theorems are shown: (1) If F contains the self-dual functions and G
contains the planar graphs then the fixed-point existence problem for (F,
G)-systems with local transition function given by truth-tables is NP-complete;
otherwise, it is decidable in polynomial time. (2) If F contains the self-dual
functions and G contains the graphs having vertex covers of size one then the
fixed-point existence problem for (F, G)-systems with local transition function
given by formulas or circuits is NP-complete; otherwise, it is decidable in
polynomial time.Comment: 17 pages; this version corrects an error/typo in the 2008/01/24
versio
Fast counting with tensor networks
We introduce tensor network contraction algorithms for counting satisfying
assignments of constraint satisfaction problems (#CSPs). We represent each
arbitrary #CSP formula as a tensor network, whose full contraction yields the
number of satisfying assignments of that formula, and use graph theoretical
methods to determine favorable orders of contraction. We employ our heuristics
for the solution of #P-hard counting boolean satisfiability (#SAT) problems,
namely monotone #1-in-3SAT and #Cubic-Vertex-Cover, and find that they
outperform state-of-the-art solvers by a significant margin.Comment: v2: added results for monotone #1-in-3SAT; published versio
Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems
We present dichotomy theorems regarding the computational complexity of
counting fixed points in boolean (discrete) dynamical systems, i.e., finite
discrete dynamical systems over the domain {0,1}. For a class F of boolean
functions and a class G of graphs, an (F,G)-system is a boolean dynamical
system with local transitions functions lying in F and graphs in G. We show
that, if local transition functions are given by lookup tables, then the
following complexity classification holds: Let F be a class of boolean
functions closed under superposition and let G be a graph class closed under
taking minors. If F contains all min-functions, all max-functions, or all
self-dual and monotone functions, and G contains all planar graphs, then it is
#P-complete to compute the number of fixed points in an (F,G)-system; otherwise
it is computable in polynomial time. We also prove a dichotomy theorem for the
case that local transition functions are given by formulas (over logical
bases). This theorem has a significantly more complicated structure than the
theorem for lookup tables. A corresponding theorem for boolean circuits
coincides with the theorem for formulas.Comment: 16 pages, extended abstract presented at 10th Italian Conference on
Theoretical Computer Science (ICTCS'2007
New Planar P-time Computable Six-Vertex Models and a Complete Complexity Classification
We discover new P-time computable six-vertex models on planar graphs beyond
Kasteleyn's algorithm for counting planar perfect matchings. We further prove
that there are no more: Together, they exhaust all P-time computable six-vertex
models on planar graphs, assuming #P is not P. This leads to the following
exact complexity classification: For every parameter setting in
for the six-vertex model, the partition function is either (1) computable in
P-time for every graph, or (2) #P-hard for general graphs but computable in
P-time for planar graphs, or (3) #P-hard even for planar graphs. The
classification has an explicit criterion. The new P-time cases in (2) provably
cannot be subsumed by Kasteleyn's algorithm. They are obtained by a non-local
connection to #CSP, defined in terms of a "loop space".
This is the first substantive advance toward a planar Holant classification
with not necessarily symmetric constraints. We introduce M\"obius
transformation on as a powerful new tool in hardness proofs for
counting problems.Comment: 61 pages, 16 figures. An extended abstract appears in SODA 202
Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography
We study maximal identifiability, a measure recently introduced in Boolean
Network Tomography to characterize networks' capability to localize failure
nodes in end-to-end path measurements. We prove tight upper and lower bounds on
the maximal identifiability of failure nodes for specific classes of network
topologies, such as trees and -dimensional grids, in both directed and
undirected cases. We prove that directed -dimensional grids with support
have maximal identifiability using monitors; and in the
undirected case we show that monitors suffice to get identifiability of
. We then study identifiability under embeddings: we establish relations
between maximal identifiability, embeddability and graph dimension when network
topologies are model as DAGs. Our results suggest the design of networks over
nodes with maximal identifiability using
monitors and a heuristic to boost maximal identifiability on a given network by
simulating -dimensional grids. We provide positive evidence of this
heuristic through data extracted by exact computation of maximal
identifiability on examples of small real networks
- …