Complexity Classes and Completeness in Algebraic Geometry

被引:0
|
作者
M. Umut Isik
机构
[1] University of California,Department of Mathematics
[2] Irvine,undefined
关键词
Complexity classes; Completeness; Resultant; 14Q20; 68Q15;
D O I
暂无
中图分类号
学科分类号
摘要
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
页数:13
相关论文
共 50 条