The following pages link to Going after the k-SAT threshold (Q5495841):
Displaying 15 items.
- Generalised and quotient models for random and/or~trees and application to satisfiability (Q727977) (← links)
- The asymptotic \(k\)-SAT threshold (Q900872) (← links)
- Proof of the satisfiability conjecture for large \(k\) (Q2171413) (← links)
- Statistical limits of spiked tensor models (Q2179237) (← links)
- \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems (Q2228416) (← links)
- Optimal testing for planted satisfiability problems (Q2259537) (← links)
- Minimal contagious sets in random regular graphs (Q2350108) (← links)
- Phase Transitions in Discrete Structures (Q2808189) (← links)
- The Number of Satisfying Assignments of Random Regular<i>k</i>-SAT Formulas (Q3177360) (← links)
- Random Instances of Problems in NP – Algorithms and Statistical Physics (Q3464473) (← links)
- Planting Colourings Silently (Q5366948) (← links)
- Satisfiability threshold for power law random 2-SAT in configuration model (Q5896832) (← links)
- Satisfiability threshold for random regular \textsc{nae-sat} (Q5963757) (← links)
- Biased random <i>k</i>‐SAT (Q6074657) (← links)
- Ultrametricity in spin glasses (Q6118126) (← links)
