Segmentation de la sériation pour la résolution de #SAT
We propose here a general method for approximating the number of solutions of a boolean formula in conjunctive normal form F. By applying the principle "divise to resolve", this method reduces considerably the computational complexity. It is based on cutting a seriation established on an i...
Kaydedildi:
| Yayımlandı: | URI:https://journals.openedition.org/msh, |
|---|---|
| Asıl Yazarlar: | , |
| Materyal Türü: | Article ou chapitre numérique |
| Dil: | Français |
| Baskı/Yayın Bilgisi: |
Mathématiques et sciences humaines
2006
|
| Konular: | |
| Online Erişim: | Accès Université d'Orléans et IFPM Accès Université d'Orléans et IFPM |