406 research outputs found

    The complexity of planar Boolean #CSP with complex weights

    Get PDF

    Polynomial-time Solvable #CSP Problems via Algebraic Models and Pfaffian Circuits

    Full text link
    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

    New Planar P-time Computable Six-Vertex Models and a Complete Complexity Classification

    Full text link
    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 C{\mathbb C} 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 C{\mathbb C} as a powerful new tool in hardness proofs for counting problems.Comment: 61 pages, 16 figures. An extended abstract appears in SODA 202

    Holographic Algorithm with Matchgates Is Universal for Planar #\#CSP Over Boolean Domain

    Full text link
    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
    corecore