Non-Adaptive Data Structure Lower Bounds for Median and Predecessor Search from Sunflowers.Sivaramakrishnan Natarajan Ramamoorthy,Anup RaoElectronic Colloquium on Computational Complexity (ECCC)(2017)引用 24|浏览39暂无评分AI 理解论文溯源树样例生成溯源树,研究论文发展脉络