Solving \#SAT using vertex covers (Q2464035): Difference between revisions

@@ Property / DOI @@
-.1007/s00236-007-0056-x
@@ Property / DOI: 10.1007/s00236-007-0056-x / 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.1007/s00236-007-0056-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2093939144
@@ Property / OpenAlex ID: W2093939144 / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Vertex Cover: Further Observations and Further Improvements
+Normal rank
@@ Property / cites work @@
+Improved Parameterized Upper Bounds for Vertex Cover
+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 @@
+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 @@
+Counting truth assignments of formulas of bounded tree-width or clique-width
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of Counting Problems
@@ Property / cites work: The Parameterized Complexity of Counting Problems / 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 @@
+Fixed-parameter complexity in AI and nonmonotonic reasoning
+Normal rank
@@ Property / cites work @@
+Graph-modeled data clustering: Exact algorithms for clique generation
+Normal rank
@@ Property / cites work @@
+CNF-Satisfiability Test by Counting and Polynomial Average Time
+Normal rank
@@ Property / cites work @@
+Q2741513
@@ Property / cites work: Q2741513 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+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 @@
+Algorithms for Propositional Model Counting
@@ Property / cites work: Algorithms for Propositional Model Counting / 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 @@
+Backdoor sets for DLL subsolvers
@@ Property / cites work: Backdoor sets for DLL subsolvers / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00236-007-0056-X
@@ Property / DOI: 10.1007/S00236-007-0056-X / rank @@
+Normal rank