Program for stream Complexity

FB-01: Complexity
Stream: Complexity
Room: L226
Chair(s): Patrick De Causmaecker

• On SAT information content, its polynomial-time solvability and fixed code algorithms
  Maciej Drozdowski
• Complexity of the uniqueness problem of a minimum vertex cover in a graph
  Olivier Hudry
• The constrained bottleneck spanning tree problem with upgrades
  Bryan Coulier, Hatice Calik, Greet Vanden Berghe
• Dedekind Numbers, counting monotone Boolean functions on a finite set: formula's and complexity issues.
  Patrick De Causmaecker