Exact algorithms for exact satisfiability problems / by Vilhelm Dahllöf.

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

Saved in:
Bibliographic Details
Main Author: Dahllöf, Vilhelm, 1974- (Author)
Corporate Author: Linköpings universitet. Institutionen för datavetenskap (Publisher)
Format: Thesis Book
Language:English
Published: Linköping : Department of Computer and Information Science, Linköpings universitet, 2006
Series:Linköping studies in science and technology. Dissertations, 1013
Subjects:
Online Access:Sammanfattning och fulltext från Linköping Electronic Press
ISBN:9185523976

Digital

Sammanfattning och fulltext från Linköping Electronic Press

Magasin - måste förbeställas

Holdings details from Magasin - måste förbeställas
Volume Call Number Loan type Availability
pP 3431 Läsesalslån Available Check Hold