|
|
|
|
Complexity Classes and Completeness in Algebraic Geometry
|
|
|
|
|
|
|
|
نویسنده
|
Isik M. Umut
|
|
منبع
|
foundations of computational mathematics - 2019 - دوره : 19 - شماره : 2 - صفحه:245 -258
|
|
چکیده
|
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.
|
|
کلیدواژه
|
Complexity classes ,Completeness ,Resultant ,14Q20 ,68Q15
|
|
آدرس
|
University of California, Department of Mathematics, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|