Swedish web site
News 2013
Exploiting Structure in CSP-related Problems
By relating complexity issues in constraint satisfaction problems to properties
of graphs and their structure Tommy Färnqvist has in a recent PhD shown that a
large class of applications e.g. in database search or AI do not have efficient
solutions, thus not polynomially solvable. He has thereafter found a metric to
relate problems that are approximation friendly.
Read more
Page responsible: Webmaster
