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

Anders Haraldsson, one of the early pioneers of computer science in Sweden, and an inspiration engine on teaching and learning for generations of computer scientists, was thanked in a touching show of support by students and colleagues at IDA on the occasion of his retirement.

Thanks to a cooperation with Ericsson, Christoph Kessler has got access to new, specially-equipped computers installed for education purposes, and thereby able to build up a new laboratory for multicore programming that will be used in courses at master and PhD level and for thesis projects in the multicore area.
Read more