Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1205.4124

The permanent, graph gadgets and counting solutions for certain types of planar formulas

Christian Schridde
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we build on the idea of Valiant \cite{Val79a} and Ben-Dor/Halevi \cite{Ben93}, that is, to count the number of satisfying solutions of a boolean formula via computing the permanent of a specially constructed matrix. We show that the Desnanot-Jacobi identity ($\dji$) prevents Valiant's original approach to achieve a parsimonious reduction to the permanent over a field of characteristic two. As the next step, since the computation of the permanent is $#\classP$-complete, we make use of the equality of the permanent and the number of perfect matchings in an unweighted graph's bipartite double cover. Whenever this bipartite double cover (BDC) is planar, the number of perfect matchings can be counted in polynomial time using Kasteleyn's algorithm \cite{Kas67}. To enforce planarity of the BDC, we replace Valiant's original gadgets with new gadgets and describe what properties these gadgets must have. We show that the property of \textit{circular planarity} plays a crucial role to find the correct gadgets for a counting problem. To circumvent the $\dji$-barrier, we switch over to fields $\mathbb{Z}/p\mathbb{Z}$, for a prime $p > 2$. With this approach we are able to count the number of solutions for $\forestdreisat$ formulas in randomized polynomial time. Finally, we present a conjecture that states which kind of generalized gadgets can not be found, since otherwise one could prove $\classRP = \classNP$. The conjecture establishes a relationship between the determinants of the minors of a graph $\grG$'s adjacency matrix and the \textit{circular planar} structure of $\grG$'s BDC regarding a given set of nodes.

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

Christian Schridde. 2012-05-18. The permanent, graph gadgets and counting solutions for certain types of planar formulas. https://arxiv.org/abs/1205.4124

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗