Cargando…
Uniquely Satisfiable d-Regular (k,s)-SAT Instances
Unique k-SAT is the promised version of k-SAT where the given formula has 0 or 1 solution and is proved to be as difficult as the general k-SAT. For any [Formula: see text] , [Formula: see text] and [Formula: see text] , a parsimonious reduction from k-CNF to d-regular (k,s)-CNF is given. Here regul...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
MDPI
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7517085/ https://www.ncbi.nlm.nih.gov/pubmed/33286341 http://dx.doi.org/10.3390/e22050569 |