Complexity Classes and Completeness in Algebraic Geometry

被引：2
|
作者：
Isik, M. Umut [1 ]
机构：
[1] Univ Calif Irvine, Dept Math, 340 Rowland Hall,Bldg 400, Irvine, CA 92697 USA
来源：
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS | 2019年 / 19卷 / 02期
关键词：
Complexity classes; Completeness; Resultant;
D O I：
10.1007/s10208-018-9383-2
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study the computational complexity of sequences of projective varieties. We define analogues of the complexity classes P and NP for these and prove the NP-completeness of a sequence called the universal circuit resultant. This is the first family of compact spaces shown to be NP-complete in a geometric setting.
引用
收藏
页码：245 / 258
页数：14
相关论文
共 50 条
12345