Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight (Q3007678): Difference between revisions

@@ Property / cites work @@
+On Acyclic Conjunctive Queries and Constant Delay Enumeration
+Normal rank
@@ Property / cites work @@
+Q4242014
@@ Property / cites work: Q4242014 / rank @@
+Normal rank
@@ Property / cites work @@
+Tractable decision for a constraint language implies tractable search
+Normal rank
@@ Property / cites work @@
+On generating all solutions of generalized satisfiability problems
+Normal rank
@@ Property / cites work @@
+Complexity of constraints. An overview of current research themes
+Normal rank
@@ Property / cites work @@
+Nonuniform Boolean constraint satisfaction problems with cardinality constraint
+Normal rank
@@ Property / cites work @@
+Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
+Normal rank
@@ Property / cites work @@
+Lower bounds for three algorithms for transversal hypergraph generation
+Normal rank
@@ Property / cites work @@
+On the algebraic structure of combinatorial problems
+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 @@
+Introduction to the Maximum Solution Problem
@@ Property / cites work: Introduction to the Maximum Solution Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4526965
@@ Property / cites work: Q4526965 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graph coloring is not self-reducible, assuming P\(\neq NP\)
+Normal rank
@@ Property / cites work @@
+On the Hardness of Losing Weight
@@ Property / cites work: On the Hardness of Losing Weight / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerating All Solutions for Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+Partial Polymorphisms and Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+Enumeration of the Monomials of a Polynomial and Related Complexity Classes
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
+Normal rank