Hardness of Approximation Algorithms on k-SAT and (k, s)-SAT Problems

Tianyan Deng, Daoyun Xu. Hardness of Approximation Algorithms on k-SAT and (k, s)-SAT Problems. In Proceedings of the 9th International Conference for Young Computer Scientists, ICYCS 2008, Zhang Jia Jie, Hunan, China, November 18-21, 2008. pages 60-64, IEEE Computer Society, 2008. [doi]

Abstract

Abstract is missing.