Programowanie dynamiczne z gwarancjami
2018/28/T/ST6/00084
Descriptors
- ST6_6: Algorytmika, algorytmy równoległe, rozproszone i sieciowe, algorytmiczna teoria gier
- ST6_4: Metody formalne, teoretyczne podstawy informatyki w tym informatyka teoretyczna
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
ETIUDA 6 – announced on 2017-12-15
- Amount awarded
- 113 322 PLN
- Project start date
- 2018-10-01
- Project end date
- 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 (5)
-
Equal-Subset-Sum Faster Than the Meet-in-the-Middle
- Authors:
- Mucha, Marcin ; Nederlof, Jesper ; Pawlewicz, Jakub ; Wegrzycki, Karol
- Conference:
- 27th Annual European Symposium on Algorithms (ESA 2019) (year: 2019, pages: 73:1--73:16), Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
- Date:
- conference 9-11.09.2019
- Status:
- Published
- DOI:
- link to the publication
-
Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors
- Authors:
- Jesper Nederlof, Karol Węgrzycki
- Conference:
- STOC 2021: 53rd Annual ACM Symposium on Theory of Computing (year: 2021, pages: 1670--1683), Publisher: ACM
- Date:
- conference 21-25.06.2021
- Status:
- Published
-
Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max
- Authors:
- Karl Bringmann, Marvin Künnemann, Karol Węgrzycki
- Conference:
- STOC 2019: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computin (year: 2019, pages: 943--954), Publisher: ACM
- Date:
- conference 23-26.06.2019
- Status:
- Published
-
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space
- Authors:
- Jesper Nederlof, Michal Pilipczuk, Celine M. F. Swennenhuis, Karol Wegrzycki
- Conference:
- Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020 (year: 2020, pages: 27-39), Publisher: Springer
- Date:
- conference 24-26.06.2020
- Status:
- Published
- DOI:
- link to the publication
-
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics
- Authors:
- Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis and Karol Węgrzycki
- Conference:
- Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) (year: 2021, pages: 1682--1701), Publisher: SIAM
- Date:
- conference 10-13.01.2021
- Status:
- Published
- DOI:
- link to the publication