Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds.Ninad Rajgopal,Rahul Santhanam,Srikanth SrinivasanMFCS(2018)引用 23|浏览20暂无评分AI 理解论文溯源树样例生成溯源树,研究论文发展脉络Chat Paper正在生成论文摘要