Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047): Difference between revisions

@@ Property / author @@
-Johann A. Makowsky
@@ Property / author: Johann A. Makowsky / rank @@
-Normal rank
@@ Property / author @@
+Johann A. Makowsky
@@ Property / author: Johann A. Makowsky / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2006.06.020
+Normal rank
@@ Property / OpenAlex ID @@
+W2090518395
@@ Property / OpenAlex ID: W2090518395 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability, branch-width and Tseitin tautologies
+Normal rank
@@ Property / cites work @@
+Partition-based logical reasoning for first-order and propositional theories
+Normal rank
@@ Property / cites work @@
+Splitting formulas for Tutte polynomials
@@ Property / cites work: Splitting formulas for Tutte polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizability, hypergraph operations, and logical types
+Normal rank
@@ Property / cites work @@
+Q4699283
@@ Property / cites work: Q4699283 / rank @@
+Normal rank
@@ Property / cites work @@
+Many hard examples for resolution
@@ Property / cites work: Many hard examples for resolution / rank @@
+Normal rank
@@ Property / cites work @@
+Q4508369
@@ Property / cites work: Q4508369 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. VII: Graphs as relational structures
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions.
+Normal rank
@@ Property / cites work @@
+Q4852905
@@ Property / cites work: Q4852905 / rank @@
+Normal rank
@@ Property / cites work @@
+Handle-rewriting hypergraph grammars
@@ Property / cites work: Handle-rewriting hypergraph grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Fusion in relational structures and the verification of monadic second-order properties
+Normal rank
@@ Property / cites work @@
+On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
+Normal rank
@@ Property / cites work @@
+Monadic second-order evaluations on tree-decomposable graphs
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of generalized satisfiability counting problems
+Normal rank
@@ Property / cites work @@
+Complexity Classifications of Boolean Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+Tree clustering for constraint networks
@@ Property / cites work: Tree clustering for constraint networks / rank @@
+Normal rank
@@ Property / cites work @@
+Logical description of context-free graph languages
+Normal rank
@@ Property / cites work @@
+The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
+Normal rank
@@ Property / cites work @@
+The complexity of first-order and monadic second-order logic revisited
+Normal rank
@@ Property / cites work @@
+On the complexity of regular resolution and the Davis-Putnam procedure
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
@@ Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank @@
+Normal rank
@@ Property / cites work @@
+Q4535802
@@ Property / cites work: Q4535802 / rank @@
+Normal rank
@@ Property / cites work @@
+The intractability of resolution
@@ Property / cites work: The intractability of resolution / rank @@
+Normal rank
@@ Property / cites work @@
+Unification as a complexity measure for logic programming
+Normal rank
@@ Property / cites work @@
+On generating all maximal independent sets
@@ Property / cites work: On generating all maximal independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768337
@@ Property / cites work: Q2768337 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic uses of the Feferman-Vaught theorem
@@ Property / cites work: Algorithmic uses of the Feferman-Vaught theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
+Normal rank
@@ Property / cites work @@
+Farrell polynomials on graphs of bounded tree width
+Normal rank
@@ Property / cites work @@
+Tree-width and the monadic quantifier hierarchy.
@@ Property / cites work: Tree-width and the monadic quantifier hierarchy. / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S
+Normal rank
@@ Property / cites work @@
+Polynomial Invariants of Graphs
@@ Property / cites work: Polynomial Invariants of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+Tutte polynomials computable in polynomial time
@@ Property / cites work: Tutte polynomials computable in polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+All structured programs have small tree width and good register allocation
+Normal rank
@@ Property / cites work @@
+On the colored Tutte polynomial of a graph of bounded treewidth
+Normal rank
@@ Property / cites work @@
+Q5593816
@@ Property / cites work: Q5593816 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank