Uniquely Satisfiable <i>d</i>-Regular (<i>k</i>,<i>s</i>)-SAT Instances

Uniquely Satisfiable <i>d</i>-Regular (<i>k</i>,<i>s</i>)-SAT Instances

Unique <i>k</i>-SAT is the promised version of <i>k</i>-SAT where the given formula has 0 or 1 solution and is proved to be as difficult as the general <i>k</i>-SAT. For any <inline-formula> <math display="inline"> <semantics> <mrow&...

Full description

Bibliographic Details
Main Authors: Zufeng Fu, Daoyun Xu
Format: Article
Language:English
Published: MDPI AG 2020-05-01
Series:Entropy
Subjects:
<i>d</i>-regular (<i>k</i>,<i>s</i>)-CNF
SAT-problem
uniquely satisfiable
Online Access:https://www.mdpi.com/1099-4300/22/5/569

Internet

https://www.mdpi.com/1099-4300/22/5/569

Similar Items