The complexity to compute the Euler characteristic of complex varieties

DOI10.1016/j.crma.2004.06.008zbMath1099.14049OpenAlexW2076534671WikidataQ57733235 ScholiaQ57733235MaRDI QIDQ1886973

Peter Bürgisser, Felipe Cucker, Martin Lotz

Publication date: 23 November 2004

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2004.06.008

Mathematics Subject Classification ID

Computational aspects in algebraic geometry (14Q99)

Uses Software

• CSM-A

Cites Work

• Unnamed Item
• The complexity of computing the permanent
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• Singularities and topology of hypersurfaces
• Computing characteristic classes of projective schemes.
• Counting complexity classes for numeric computations II

This page was built for publication: The complexity to compute the Euler characteristic of complex varieties