A note on VNP-completeness and border complexity

Christian Ikenmeyer, Abhiroop Sanyal

Information Processing Letters(2022)

引用 2|浏览7
暂无评分
摘要
•VNP ∖ VNPC lies dense in VNP.•VNPC lies dense in VNP.•Analogously for VF, VBP, and VP.
更多
查看译文
关键词
Theory of computation,Computational complexity,Algebraic complexity theory,Border complexity,Reductions
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要