Tight Lower Bounds Under Strong Complexity Assumptions
2015/17/N/ST6/01224
Keywords
Descriptors
- ST6_6: Algorytmika, algorytmy równoległe, rozproszone i sieciowe, algorytmiczna teoria gier
Panel
ST6 – Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution
Uniwersytet Warszawski, Wydział Matematyki, Informatyki i Mechaniki
Voivodeship: mazowieckie
Principal investigator (from the host institution)
Number of co-investigators in the project: 2
Call
PRELUDIUM 9 – announced on 2015-03-16
- Amount awarded
- 64 800 PLN
- Project start date
- 2016-03-16
- Project end date
- 2018-09-15
- Project duration
- 30 months (the same as in the proposal)
- Project status
- Project settled
Project description
Download the project description in a pdf file
Note — project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.
Information in the final report
Articles in post-conference publications (2)
-
Tight Lower Bounds for the Complexity of Multicoloring.
- Authors:
- Marthe Bonamy, Łukasz Kowalik, Michał Pilipczuk, Arkadiusz Socała, Marcin Wrochna
- Conference:
- 25th Annual European Symposium on Algorithms, ESA 2017 (year: 2017, pages: 18:1--18:14), Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
- Date:
- conference 4-6 września 2017
- Status:
- Published
-
Tight Lower Bounds for List Edge Coloring
- Authors:
- Łukasz Kowalik, Arkadiusz Socała
- Conference:
- 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018) (year: 2018, pages: 28:1--28:12), Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
- Date:
- conference 18-20 czerwca 2018
- Status:
- Published