Data Structures Lower Bounds and Popular Conjectures
Computational Complexity
2021-02-19 v1
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 and several data structure like problems such as non-adaptive function inversion of Hellman 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.
Cite
@article{arxiv.2102.09294,
title = {Data Structures Lower Bounds and Popular Conjectures},
author = {Pavel Dvořák and Michal Koucký and Karel Král and Veronika Slívová},
journal= {arXiv preprint arXiv:2102.09294},
year = {2021}
}