The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs.

Chris Calabro Russell Impagliazzo Valentine Kabanets Ramamohan Paturi The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. 135- 2003 conf/coco/2003 IEEE Conference on Computational Complexity http://csdl.computer.org/comp/proceedings/complexity/2003/1879/00/18790135abs.htm db/conf/coco/coco2003.html#CalabroIKP03