Session FB-1: Complexity in stream Complexity
Friday, 10:30 - 12:00Room: L226
| Session chair(s): |
|
| 17. On SAT information content, its polynomial-time solvability and fixed code algorithms |
Maciej Drozdowski
[] - Poland | accepted | ||
| 51. Complexity of the uniqueness problem of a minimum vertex cover in a graph |
Olivier Hudry
[] - France | accepted | ||
| 44. The constrained bottleneck spanning tree problem with upgrades |
Bryan Coulier
[] - Belgium | accepted | ||
| Hatice Calik
[] - Belgium | ||||
| Greet Vanden Berghe
[] - Belgium | ||||
| 26. Dedekind Numbers, counting monotone Boolean functions on a finite set: formula's and complexity issues. |
Patrick De Causmaecker
[] - Belgium | accepted | ||