Counting complexity classes for numeric computations. III: Complex projective sets

DOI10.1007/s10208-005-0146-xzbMath1100.68032DBLPjournals/focm/BurgisserCL05OpenAlexW1980441998WikidataQ57733208 ScholiaQ57733208MaRDI QIDQ2505650

Felipe Cucker, Peter Bürgisser, Martin Lotz

Publication date: 28 September 2006

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10208-005-0146-x

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (5)

Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem ⋮ A complex analogue of Toda's theorem ⋮ Computing characteristic classes of subschemes of smooth toric varieties ⋮ Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets ⋮ A direct algorithm to compute the topological Euler characteristic and Chern-Schwartz-MacPherson class of projective complete intersection varieties

This page was built for publication: Counting complexity classes for numeric computations. III: Complex projective sets