"Unique k-SAT is as Hard as k-SAT."

Subhas Kumar Ghosh (2006)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2022-09-28

a service of  Schloss Dagstuhl - Leibniz Center for Informatics