Algorithmic Tools for Optimization Problems
Event details
| Date | 14.07.2017 |
| Hour | 10:00 › 12:00 |
| Speaker | Buddhima Gamlath Ralalage |
| Location | |
| Category | Conferences - Seminars |
EDIC candidacy exam
Exam president: Prof. Michael Gastpar
Thesis advisor: Prof. Ola Svensson
Co-examiner: Prof. Michael Kapralov
Abstract
Background papers
An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound, by Bansal, Nikhil, Daniel Dadush, and Shashwat Garg.
arXiv:1605.02882 [cs.DS]
Faster all-pairs shortest paths via circuit complexity, by Williams, Ryan. arXiv:1312.6680 [cs.DS]
Fast learning requires good memory: A time-space lower bound for parity learning, by Raz, Ran. arXiv:1602.05161 [cs.LG]
Practical information
- General public
- Free
Contact
- EDIC - [email protected]