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 incidence d...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Francês |
| Vydáno: |
Centre d’analyse et de mathématique sociales de l’EHESS
1999
|
| Témata: | |
| On-line přístup: | https://doi.org/10.4000/msh.2793 https://hdl.handle.net/20.500.13089/iggr https://journals.openedition.org/msh/2793 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|