Characterizing arithmetic circuit classes by constraint satisfaction problems

Authors:
Stefan Mengel
Affiliations:
Institute of Mathematics, University of Paderborn, Paderborn, Germany
Venue:
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Year:
2011

Citing 13
Cited 1

Computing algebraic formulas using a constant number of registers

SIAM Journal on Computing
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic

Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
The complexity of acyclic conjunctive queries

Journal of the ACM (JACM)
NC-Algorithms for Graphs with Small Treewidth

WG '88 Proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Counting truth assignments of formulas of bounded tree-width or clique-width

Discrete Applied Mathematics
Characterizing Valiant's algebraic complexity classes

Journal of Complexity
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width

Graph-Theoretic Concepts in Computer Science
A Dichotomy Theorem for Polynomial Evaluation

MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
On the expressive power of planar perfect matching and permanents of bounded treewidth matrices

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
On the expressive power of CNF formulas of bounded tree- and clique-width

Discrete Applied Mathematics

The complexity of weighted counting for acyclic conjunctive queries

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We explore the expressivity of constraint satisfaction problems (CSPs) in the arithmetic circuit model. While CSPs are known to yield VNP-complete polynomials in the general case, we show that for different restrictions of the structure of the CSPs we get characterizations of different arithmetic circuit classes. In particular we give the first natural non-circuit characterization of VP, the class of polynomial families efficiently computable by arithmetic circuits.