Creative Commons Attribution 4.0 license (CC BY 4.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ESA.2021.39
URN: urn:nbn:de:0030-drops-146207
URL: https://drops.dagstuhl.de/opus/volltexte/2021/14620/
Dvořák, Pavel ; Koucký, Michal ; Král, Karel ; Slívová, Veronika
Data Structures Lower Bounds and Popular Conjectures
| pdf-format: |
|
Abstract
In this paper, we investigate the relative power of several conjectures that attracted recently lot of interest. We establish a connection between the Network Coding Conjecture (NCC) of Li and Li [Li and Li, 2004] and several data structure problems such as non-adaptive function inversion of Hellman [M. Hellman, 1980] and the well-studied problem of polynomial evaluation and interpolation. In turn these data structure problems imply super-linear circuit lower bounds for explicit functions such as integer sorting and multi-point polynomial evaluation.
BibTeX - Entry
@InProceedings{dvorak_et_al:LIPIcs.ESA.2021.39,
author = {Dvo\v{r}\'{a}k, Pavel and Kouck\'{y}, Michal and Kr\'{a}l, Karel and Sl{\'\i}vov\'{a}, Veronika},
title = {{Data Structures Lower Bounds and Popular Conjectures}},
booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)},
pages = {39:1--39:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-204-4},
ISSN = {1868-8969},
year = {2021},
volume = {204},
editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14620},
URN = {urn:nbn:de:0030-drops-146207},
doi = {10.4230/LIPIcs.ESA.2021.39},
annote = {Keywords: Data structures, Circuits, Lower bounds, Network Coding Conjecture}
}
| Keywords: | Data structures, Circuits, Lower bounds, Network Coding Conjecture | |
| Seminar: | 29th Annual European Symposium on Algorithms (ESA 2021) | |
| Issue date: | 2021 | |
| Date of publication: | 31.08.2021 |
