23 citations · 23 across the 3 of their papers we have counts for
1 paper · 1 filter
M. Umut Isik
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 sequ…