New Bounds for Combinatorial Problems and Quasi-Gray Codes
| Thesis title in Czech: | Nové Odhady pro Kombinatorických Problémů a Kvazi-Grayových Kódů |
|---|---|
| Thesis title in English: | New Bounds for Combinatorial Problems and Quasi-Gray Codes |
| English key words: | Boolean matrix multiplication, Combinatorial lower bounds, Edit distance, Pattern matching, Graph algorithm, Quasi-Gray code |
| Academic year of topic announcement: | 2010/2011 |
| Thesis type: | dissertation |
| Thesis language: | angličtina |
| Department: | Computer Science Institute of Charles University (32-IUUK) |
| Supervisor: | prof. Mgr. Michal Koucký, Ph.D. |
| Author: | hidden - assigned and confirmed by the Study Dept. |
| Date of registration: | 02.10.2014 |
| Date of assignment: | 02.10.2014 |
| Confirmed by Study dept. on: | 28.01.2015 |
| Date and time of defence: | 06.06.2019 10:00 |
| Date of electronic submission: | 18.03.2019 |
| Date of submission of printed version: | 18.03.2019 |
| Date of proceeded defence: | 06.06.2019 |
| Opponents: | Virginia Vassilevska Williams |
| Ely Porat | |