Tianyan Deng, Daoyun Xu. NP-Completeness of (k-SAT, r-UNk-SAT) and (LSAT>=k, r-UNLSAT>=k). In Franco P. Preparata, Xiaodong Wu, Jianping Yin, editors, Frontiers in Algorithmics, Second Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings. Volume 5059 of Lecture Notes in Computer Science, pages 79-88, Springer, 2008. [doi]
Abstract is missing.