arXiv · 1609.02562
Complexity Classes and Completeness in Algebraic Geometry
Abstract
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.
Explore related subjects
Keep this discovery
M. Umut Isik. 2016-09-08. Complexity Classes and Completeness in Algebraic Geometry. https://arxiv.org/abs/1609.02562
Cite the original work for its findings. Save a collection to share your selection of sources.