Evènement pour le groupe Séminaire Méthodes Formelles


Date 2019-04-16  11:00-12:00
TitreFaster k-SAT algorithms using biased-PPSZ 
Résumé The PPSZ algorithm, due to Paturi, Pudlak, Saks and Zane, is currently the fastest known algorithm for the k-SAT problem, for every k>3. For 3-SAT, a tiny improvement over PPSZ was obtained by Hertli. We introduce a biased version of the PPSZ algorithm using which we obtain an improvement over PPSZ for every k>=3. For k=3 we also improve on Herli's result and get a much more noticeable improvement over PPSZ, though still relatively small. In particular, for Unique 3-SAT, we improve the current bound from 1.308^n to 1.307^n. Joint work with Thomas Dueholm Hansen, Haim Kaplan and Or Zamir 
Lieu178 
OrateurUri Zwick 
UrlTel Aviv University 



Aucun document lié à cet événement.

Retour
Retour à l'index