The following pages link to On Random 3-sat (Q4862742):
Displaying 8 items.
- On threshold properties of \(k\)-SAT: An additive viewpoint (Q852710) (← links)
- On good algorithms for determining unsatisfiability of propositional formulas (Q1408376) (← links)
- Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
- The scaling window of the 2-SAT transition (Q2725029) (← links)
- Selecting Complementary Pairs of Literals (Q3439115) (← links)
- Sharp thresholds of graph properties, and the $k$-sat problem (Q4257709) (← links)
- Rigorous results for random (\(2+p)\)-SAT (Q5958803) (← links)
- Upper bounds on the satisfiability threshold (Q5958807) (← links)
