Projects funded by the NCN
Algebraic theory for CSP (tractability, approximation and optimization)
2014/13/B/ST6/01812
Keywords:
Constraint Satisfaction Problem computational complexity approximation algorithms optimization
Descriptors:
- ST6_4: Formal methods, foundations of computer science, including theoretical computer science, quantum algorithms
- ST6_6: Algorithms, parallel, distributed and network algorithms, algorithmic game theory
- ST1_18: Control theory and optimisation
Panel:
ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution :
Uniwersytet Jagielloński, Wydział Matematyki i Informatyki
woj. małopolskie
Principal investigator (from the host institution):
Number of co-investigators in the project: 3
Call: OPUS 7 - announced on 2014-03-17
Amount awarded: 486 920 PLN
Project start date (Y-m-d): 2015-02-18
Project end date (Y-m-d): 2019-02-17
Project duration:: 48 months (the same as in the proposal)
Project status: Project settled