DMCA
Typical random 3-SAT formulae and the satisfiability threshold (2000)
Cached
Download Links
- [arxiv.org]
- [arxiv.org]
- [algo.inria.fr]
- [www.stevens.edu]
- [eccc.hpi-web.de]
- DBLP
Other Repositories/Bibliography
by
O. Dubois
,
Y. Boufkhad
| Venue: | in Proceedings of the Eleventh ACM-SIAM Symposium on Discrete Algorithms |
| Citations: | 97 - 4 self |
BibTeX
@INPROCEEDINGS{Dubois00typicalrandom,
author = {O. Dubois and Y. Boufkhad},
title = {Typical random 3-SAT formulae and the satisfiability threshold},
booktitle = {in Proceedings of the Eleventh ACM-SIAM Symposium on Discrete Algorithms},
year = {2000},
pages = {124--126}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract: We present a new structural (or syntactic) approach for estimating the satisfiability threshold of random 3-SAT formulae. We show its efficiency in obtaining a jump from the previous upper bounds, lowering them to 4.506. The method combines well with other techniques, and also applies to other problems, such as the 3-colourability of random graphs. 1
