Projects funded by the NCN
Efficient algorithms and conditional lower bounds for problems on trees
2017/27/N/ST6/02719
Keywords:
algorithm tree graph lower bound dynamic programming
Descriptors:
- ST6_6: Algorithms, parallel, distributed and network algorithms, algorithmic game theory
- ST6_4: Formal methods, foundations of computer science, including theoretical computer science, quantum algorithms
Panel:
ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution :
Uniwersytet Wrocławski, Wydział Matematyki i Informatyki
woj. dolnośląskie
Principal investigator (from the host institution):
Number of co-investigators in the project: 2
Call: PRELUDIUM 14 - announced on 2017-09-15
Amount awarded: 180 200 PLN
Project start date (Y-m-d): 2018-09-03
Project end date (Y-m-d): 2021-10-02
Project duration:: 37 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.