Pages that link to "Item:Q4739584"

The following pages link to Random MAX SAT, random MAX CUT, and their phase transitions (Q4739584):

Displaying 17 items.

• Phase transitions of contingent planning problem (Q474510) (← links)
• Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
• An upper (lower) bound for Max (Min) CSP (Q893727) (← links)
• Disorder chaos in some diluted spin Glass models (Q1661553) (← links)
• A tighter upper bound for random MAX \(2\)-SAT (Q1944049) (← links)
• Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
• On the maximal cut in a random hypergraph (Q2121837) (← links)
• A novel algorithm for Max Sat calling MOCE to order (Q2149880) (← links)
• On the satisfiability threshold of formulas with three literals per clause (Q2271431) (← links)
• CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
• Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
• PHASE TRANSITIONS OF EXPSPACE-COMPLETE PROBLEMS: A FURTHER STEP (Q2909190) (← links)
• PHASE TRANSITIONS OF EXPSPACE-COMPLETE PROBLEMS (Q3069746) (← links)
• Sparse graphs: Metrics and random models (Q5198669) (← links)
• MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems (Q6053474) (← links)
• The number of satisfying assignments of random 2‐SAT formulas (Q6074640) (← links)
• Exact enumeration of satisfiable 2-SAT formulae (Q6138912) (← links)