Characterizing Boolean satisfiability variants
Author(s)Ferreira Antunes Filho, Ivan Tadeu.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
MetadataShow full item record
We survey variants of the Boolean Satisfiability problem from over the years and organize them in what we believe to be the most comprehensive list of known results in SAT variants. We propose a new notation to specify them so that the problems can be compared with no ambiguities, and so that new problems can be more easily identified. We also show hardness of many new variants of SAT including a characterization of Sin-k SAT, hardness of variants of MAX Planar SAT, partial characterization of XNF SAT, consequences of the Ordered Planar Dichotomy, and hardness of NAE SAT variants with a bounded number of variable occurrences, in particular NAE EkSAT-k. This is joint work with Aviv Adler, Leo Alcock, Anastasiia Alokhina, Joshua Ani, Jeffrey Bosboom, Erik Demaine, Yevhenii Diomidov, Jonathan Gabor, Yuzhou Gu, Linus Hamilton, Mirai Ikebuchi, Adam Hesterberg, Jayson Lynch, Zhezheng Luo, Xiao Mao, Kevin Sun, John Urschel, Yinzhan Xu, and Lillian Zhang.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019Cataloged from student-submitted PDF version of thesis.Includes bibliographical references (pages 65-70) and index.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology
Electrical Engineering and Computer Science.