On the Concrete-Efficiency Threshold of Probabilistically-Checkable Proofs.Eli Ben-Sasson,Alessandro Chiesa,Daniel Genkin,Eran TromerElectronic Colloquium on Computational Complexity (ECCC)(2012)引用 25|浏览42暂无评分AI 理解论文溯源树样例生成溯源树,研究论文发展脉络