Upper bounds on the satisfiability threshold - Archive ouverte HAL
Article Dans Une Revue Theoretical Computer Science Année : 2001

Upper bounds on the satisfiability threshold

Résumé

We present a survey of upper bounds which has been established up to now on the satisfiability threshold of random k-SAT formulae. The ideas which led to these bounds and the techniques used to obtain them, are explained. A companion paper in this volume present a survey of the lower bounds.

Dates et versions

hal-01195615 , version 1 (08-09-2015)

Identifiants

Citer

Olivier Dubois. Upper bounds on the satisfiability threshold. Theoretical Computer Science, 2001, 265 (1-2), pp.187-197. ⟨10.1016/S0304-3975(01)00161-X⟩. ⟨hal-01195615⟩
50 Consultations
0 Téléchargements

Altmetric

Partager

More