The following pages link to A threshold for unsatisfiability (Q5096838):
Displayed 12 items.
- An improved upper bound on the non-3-colourability threshold (Q293171) (← links)
- On threshold properties of \(k\)-SAT: An additive viewpoint (Q852710) (← links)
- The asymptotic \(k\)-SAT threshold (Q900872) (← links)
- Length of prime implicants and number of solutions of random CNF formulae (Q1285568) (← links)
- The maximum length of prime implicates for instances of 3-SAT (Q1402744) (← links)
- Random 2-SAT and unsatisfiability (Q1607007) (← links)
- Phase transitions in discrete structures (Q1620869) (← links)
- The satisfiability threshold for random linear equations (Q2003764) (← links)
- Proof of the satisfiability conjecture for large \(k\) (Q2171413) (← links)
- Generating hard satisfiability problems (Q2674174) (← links)
- Random 2-SAT: Results and problems (Q5958804) (← links)
- Upper bounds on the satisfiability threshold (Q5958807) (← links)