Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe
Theoretical Computer Science
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
NC-Algorithms for Graphs with Small Treewidth
WG '88 Proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science
The Effect of Null-Chains on the Complexity of Contact Schemes
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
Algorithms for propositional model counting
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
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
Treewidth in verification: local vs. global
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
On the expressive power of CNF formulas of bounded tree- and clique-width
Discrete Applied Mathematics
Characterizing arithmetic circuit classes by constraint satisfaction problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
| Hi-index | 0.00 |
Starting point of our work is a previous paper by Flarup, Koiran, and Lyaudet [5]. There the expressive power of certain families of polynomials is investigated. Among other things it is shown that polynomials arising as permanents of bounded tree-width matrices have the same expressiveness as polynomials given via arithmetic formulas. A natural question is how expressive such restricted permanent polynomials are with respect to other graph-theoretic concepts for representing polynomials over a field $\mathbb{K}.$ One such is representing polynomials by formulas in conjunctive normal form. Here, a monomial occurs according to whether the exponent vector satisfies a given CNF formula or not. We can in a canonical way assign a graph to such a CNF formula and speak about the tree-width of the related CNF polynomial. In this paper we show that the expressiveness of CNF polynomials of bounded tree-width again gives precisely arithmetic formulas. We then study how far the approach of evaluating subclasses of permanents efficiently using a reduction to CNF formulas of bounded tree-width leads. We show that there does not exist a family of CNF polynomials of bounded tree-width which can express general permanent polynomials. The statement is unconditional. An analoguous result for CNF polynomials of bounded clique-width is given, this time under the assumption that $\# P \not\subseteq FP/poly.$ The paper contributes to the comparison between classical Boolean complexity and algebraic approaches like Valiant's one.