On exact algorithms for the permutation CSP (Q392031): Difference between revisions

@@ Property / cites work @@
+A note on exact algorithms for vertex ordering problems on graphs
+Normal rank
@@ Property / cites work @@
+Set Partitioning via Inclusion-Exclusion
@@ Property / cites work: Set Partitioning via Inclusion-Exclusion / rank @@
+Normal rank
@@ Property / cites work @@
+On Problems as Hard as CNF-SAT
@@ Property / cites work: On Problems as Hard as CNF-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Partially Ordered Jobs Faster Than 2 n
@@ Property / cites work: Scheduling Partially Ordered Jobs Faster Than 2 n / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417641
@@ Property / cites work: Q5417641 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365079
@@ Property / cites work: Q5365079 / rank @@
+Normal rank
@@ Property / cites work @@
+A new algorithm for optimal 2-constraint satisfaction and its implications
+Normal rank