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.

翻译：在本文中,我们调查了最近引起许多兴趣的若干猜想的相对力量。我们建立了李氏和李氏网络编码猜想(NCC)与若干数据结构之间的联系,如非适应功能转换赫尔曼等问题,以及研究周密的多面评价和内插问题。反过来,这些数据结构问题又意味着对整数排序和多点多点多元评价等明确功能的超线电路下限。