Exact Algorithms for Exact Satisfiability Problems

Exact Algorithms for Exact Satisfiability Problems

This thesis presents exact means to solve a family of NP-hard problems. Starting with the well-studied Exact Satisfiability problem (XSAT) parents, siblings and daughters are derived and studied, each with interesting practical and theoretical properties. While developing exact algorithms to solve t...

Full description

Bibliographic Details
Main Author: Dahllöf, Vilhelm
Format: Doctoral Thesis
Language:English
Published: Linköpings universitet, TCSLAB 2006
Subjects:
NP-hardness
exact algorithms
satisfiability
exact satisfiability
Computer science
Datalogi
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-6907
http://nbn-resolving.de/urn:isbn:91-85523-97-6

Internet

http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-6907
http://nbn-resolving.de/urn:isbn:91-85523-97-6

Similar Items