Algorithms and hardness results for some valued CSPs / by Fredrik Kuivinen.

In the Constraint Satisfaction Problem (CSP) one is supposed to find an assignment to a set of variables so that a set of given constraints are satisfied. Many problems, both practical and theoretical, can be modelled as CSPs. As these problems are computationally hard it is interesting to investiga...

Full description

Saved in:
Bibliographic Details
Main Author: Kuivinen, Fredrik, 1981- (Author)
Corporate Author: Linköpings universitet. Institutionen för datavetenskap (Publisher)
Format: Thesis Electronic eBook
Language:English
Published: Linköping : Department of Computer and Information Science, Linköpings universitet, 2009
Series:Linköping studies in science and technology. Dissertations, 1274
Subjects:
Online Access:Sammanfattning och fulltext från Linköping University Electronic Press
Related Items:Additional form: Algorithms and hardness results for some valued CSPs
NLS Notes:Papperutskrift av digital fil

Digital

Sammanfattning och fulltext från Linköping University 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