A Short Implicant of a CNF Formula with Many Satisfying Assignments

Daniel M. Kane, Osamu Watanabe 0001. A Short Implicant of a CNF Formula with Many Satisfying Assignments. In Hee-Kap Ahn, Chan-Su Shin, editors, Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings. Volume 8889 of Lecture Notes in Computer Science, pages 273-284, Springer, 2014. [doi]

Abstract

Abstract is missing.