Now showing items 1-1 of 1
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 ...