Projects funded by the NCN
Optimality program in graph homomorphism problems
2018/31/D/ST6/00062
Keywords:
graph homomorphism computational complexity algorithms
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
- ST1_14: Discrete mathematics and combinatorics
Panel:
ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution :
Politechnika Warszawska, Wydział Matematyki i Nauk Informacyjnych
woj. mazowieckie
Principal investigator (from the host institution):
Number of co-investigators in the project: 4
Call: SONATA 14 - announced on 2018-09-14
Amount awarded: 306 680 PLN
Project start date (Y-m-d): 2019-06-13
Project end date (Y-m-d): 2023-06-12
Project duration:: 48 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.