Complexity Classes and Completeness in Algebraic Geometry
Algebraic Geometry
2016-09-12 v1 Computational Complexity
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.
Cite
@article{arxiv.1609.02562,
title = {Complexity Classes and Completeness in Algebraic Geometry},
author = {M. Umut Isik},
journal= {arXiv preprint arXiv:1609.02562},
year = {2016}
}