Super Solutions of Random Instances of Satisfiability (Q3452579): Difference between revisions

@@ Property / cites work @@
+The threshold for random k-SAT is 2             <sup>k</sup>             (ln 2 - O(k))
+Normal rank
@@ Property / cites work @@
+Q3503433
@@ Property / cites work: Q3503433 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228436
@@ Property / cites work: Q4228436 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial sharpness criterion and phase transition classification for random CSPs
+Normal rank
@@ Property / cites work @@
+Frozen development in graph coloring
@@ Property / cites work: Frozen development in graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q3624064
@@ Property / cites work: Q3624064 / rank @@
+Normal rank
@@ Property / cites work @@
+Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
+Normal rank
@@ Property / cites work @@
+Random constraint satisfaction: easy generation of hard (satisfiable) instances
+Normal rank
@@ Property / cites work @@
+Q4954175
@@ Property / cites work: Q4954175 / rank @@
+Normal rank
@@ Property / cites work @@
+Many hard examples in exact phase transitions
@@ Property / cites work: Many hard examples in exact phase transitions / rank @@
+Normal rank