On the complexity of \(k\)-SAT (Q5943094): Difference between revisions

@@ Property / Wikidata QID @@
+Q56018875
@@ Property / Wikidata QID: Q56018875 / 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.1006/jcss.2000.1727
+Normal rank
@@ Property / OpenAlex ID @@
+W1985572324
@@ Property / OpenAlex ID: W1985572324 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4004078
@@ Property / cites work: Q4004078 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252729
@@ Property / cites work: Q4252729 / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental results on the crossover point in random 3-SAT
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+An O(2<sup>0.304n</sup>) Algorithm for Solving Maximum Independent Set Problem
+Normal rank
@@ Property / cites work @@
+A note on the complexity of the chromatic number problem
+Normal rank
@@ Property / cites work @@
+Solving satisfiability in less than \(2^ n\) steps
+Normal rank
@@ Property / cites work @@
+Algorithms for maximum independent sets
@@ Property / cites work: Algorithms for maximum independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4283247
@@ Property / cites work: Q4283247 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Independent Set
@@ Property / cites work: Finding a Maximum Independent Set / rank @@
+Normal rank