Algorithms, measures and upper bounds for satisfiability and related problems
The topic of exact, exponential-time algorithms for NP-hard problems has received a lot of attention, particularly with the focus of producing algorithms with stronger theoretical guarantees, e.g. upper bounds on the running time on the form O(c^n) for some c. Better methods of analysis may have an...
| Main Author: | |
|---|---|
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
Linköpings universitet, TCSLAB - Laboratoriet för teoretisk datalogi
2007
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-8714 http://nbn-resolving.de/urn:isbn:978-91-85715-55-8 |