Abstract
We extend the lower bounds on the complexity of computing Betti numbers proved in [P. Bürgisser, F. Cucker, Counting complexity classes for numeric computations II: algebraic and semialgebraic sets, J. Complexity 22 (2006) 147–191] to complex algebraic varieties. More precisely, we first prove that the problem of deciding connectedness of a complex affine or projective variety given as the zero set of integer polynomials is PSPACE-hard. Then we prove PSPACE-hardness for the more general problem of deciding whether the Betti number of fixed order of a complex affine or projective variety is at most some given integer.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
