Research Seminar
of compressing CFI graphs that leads to an \Omega(n^{k/2})-lower bound for all k. Joint work with Martin Grohe, Moritz Lichter and Pascal Schweitzer (published at FOCS 2023). December 06, 2023 Alexander [...] cluster of hardest instances. Both use cases are investigated in the case studies. October 18, 2018 Martin Böhm (University of Bremen) Online Bin Stretching: Algorithms and Computer Lower Bounds September