Projects funded by the NCN
Dolne ograniczenia złożoności problemów rozwiązywalnych w czasie wielomianowym
2018/28/T/ST6/00305
Keywords:
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 Jagielloński, Wydział Matematyki i Informatyki
woj. małopolskie
Principal investigator (from the host institution):
Number of co-investigators in the project: 2
Call: ETIUDA 6 - announced on 2017-12-15
Amount awarded: 115 676 PLN
Project start date (Y-m-d): 2018-10-01
Project end date (Y-m-d): 2019-09-30
Project duration:: 12 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)
- Equivalences between triangle and range query problemsAuthors:Lech Duraj, Krzysztof Kleiner, Adam Polak, Virginia Vassilevska WilliamsConference:2020 ACM-SIAM Symposium on Discrete Algorithms (rok: 2020, ), Wydawca: SIAMData:konferencja 05-08.01.2020Status:Published
- Monochromatic Triangles, Intermediate Matrix Products, and ConvolutionsAuthors:Andrea Lincoln, Adam Polak, Virginia Vassilevska WilliamsConference:11th Innovations in Theoretical Computer Science Conference (ITCS 2020) (rok: 2020, ), Wydawca: Schloss Dagstuhl--Leibniz- Zentrum fuer InformatikData:konferencja 12-14.01.2020Status:Published