Journal: Electronic Colloquium on Computational Complexity (ECCC)

Volume 13, Issue 062

0 -- 0Subhas Kumar Ghosh. Unique k-SAT is as Hard as k-SAT