Organizer: Marek Karpinski

Theme: The activity will focus on some fundamental problems of computational complexity of the exact and approximate computation. The special interest will be on the intrinsic complexity of certain NP-hard problems motivated by, and bordering upon, algebra, logic, coding theory, geometry as well as the combinatorial optimization and statistical physics.

Enquiries may be addressed to:

Marek Karpinski   marek@cs.uni-bonn.de