Now showing items 1-2 of 2
Step toward constant time local search for optimizing pseudo boolean functions, A
Format:born digital; masters theses
Pseudo Boolean Functions (PBFs) are the objective functions for a wide class of hard optimization problems, such as MAX-SAT and MAX-CUT. Since these problems are NP-Hard, researchers and practitioners rely on incomplete ...
Discovering and harnessing structures in solving application satisfiability instances
Format:born digital; doctoral dissertations
Boolean satisfiability (SAT) is the first problem proven to be NP-Complete. It has become a fundamental problem for computational complexity theory, and many real-world problems can be encoded as SAT instances. Two major ...