Many hard examples in exact phase transitions (Q2368999): Difference between revisions

@@ Property / cites work @@
+Rigorous results for random (\(2+p)\)-SAT
@@ Property / cites work: Rigorous results for random (\(2+p)\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Random constraint satisfaction: A more accurate picture
+Normal rank
@@ Property / cites work @@
+Scaling and universality in continuous length combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Q4542576
@@ Property / cites work: Q4542576 / rank @@
+Normal rank
@@ Property / cites work @@
+The Efficiency of Resolution and Davis--Putnam Procedures
+Normal rank
@@ Property / cites work @@
+Short proofs are narrow—resolution made simple
@@ Property / cites work: Short proofs are narrow—resolution made simple / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for finding Hamilton paths and cycles in random graphs
+Normal rank
@@ Property / cites work @@
+Q4228436
@@ Property / cites work: Q4228436 / rank @@
+Normal rank
@@ Property / cites work @@
+Many hard examples for resolution
@@ Property / cites work: Many hard examples for resolution / rank @@
+Normal rank
@@ Property / cites work @@
+The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem
+Normal rank
@@ Property / cites work @@
+Q4375756
@@ Property / cites work: Q4375756 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial sharpness criterion and phase transition classification for random CSPs
+Normal rank
@@ Property / cites work @@
+The 3-XORSAT threshold.
@@ Property / cites work: The 3-XORSAT threshold. / rank @@
+Normal rank
@@ Property / cites work @@
+A probabilistic analysis of randomly generated binary constraint satisfaction problems.
+Normal rank
@@ Property / cites work @@
+A sharp threshold for a random constraint satisfaction problem
+Normal rank
@@ Property / cites work @@
+Sharp thresholds of graph properties, and the $k$-sat problem
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Random \(k\)-SAT: A tight threshold for moderately growing \(k\)
+Normal rank
@@ Property / cites work @@
+Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story
+Normal rank
@@ Property / cites work @@
+Random constraint satisfaction: Flaws and structure
+Normal rank
@@ Property / cites work @@
+Limit distribution for the existence of Hamiltonian cycles in a random graph
+Normal rank
@@ Property / cites work @@
+Models for Random Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+The Resolution Complexity of Random Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+Determining computational complexity from characteristic ‘phase transitions’
+Normal rank
@@ Property / cites work @@
+Constructing an asymptotic phase transition in random binary constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+Q4230728
@@ Property / cites work: Q4230728 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4954175
@@ Property / cites work: Q4954175 / rank @@
+Normal rank
@@ Property / cites work @@
+On the average similarity degree between solutions of random \(k\)-SAT and random CSPs.
+Normal rank