Uniquely Satisfiable <i>d</i>-Regular (<i>k</i>,<i>s</i>)-SAT Instances
Unique <em>k</em>-SAT is the promised version of <em>k</em>-SAT where the given formula has 0 or 1 solution and is proved to be as difficult as the general <em>k</em>-SAT. For any <em>k</em> ≥ 3, s ≥ <em>f</em> (<em>k</em>,<e...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-05-01
|
| Series: | Entropy |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1099-4300/22/5/569 |