The complexity to compute the Euler characteristic of complex varieties

DOI10.1016/J.CRMA.2004.06.008MaRDI QIDQ1886973zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Review text

\textit{P. Bürgisser} and \textit{F. Cucker} [J. Complexity 22, No. 2, 147--191 (2006; Zbl 1149.68029)] proved that the computation of the Euler characteristic of a semialgebraic set is complete in the counting class \(FP_{\mathbb R}^{\sharp P_{\mathbb R}}.\) In the paper under review, the authors prove that the computation of the Euler characteristic of an affine or projective complex variety is complete in the class \(FP_{\mathbb C}^{\sharp P_{\mathbb C}}.\)

Recommendations

• On the Euler characteristic of complex algebraic varieties
• Complexity and algorithms for Euler characteristic of simplicial complexes
• Computing the Euler characteristic of generalized Kummer varieties
• The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties
• On the complexity of counting components of algebraic varieties
• Computing characteristic classes and the topological Euler characteristic of complex projective schemes
• A numerical approach for computing Euler characteristics of affine varieties
• Complexity of computation of embedded resolution of algebraic curves
• Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic
• On the complexity of the Liouville numbers in positive characteristic

Cites work

• Computing characteristic classes of projective schemes.
• Counting complexity classes for numeric computations II
• scientific article; zbMATH DE number 704831 (Why is no real title available?)
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• Singularities and topology of hypersurfaces
• The complexity of computing the permanent

Cited in

(9)

• The computational complexity of the Chow form
• On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
• Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
• Counting complexity classes for numeric computations. III: Complex projective sets
• scientific article; zbMATH DE number 4213458 (Why is no real title available?)
• On the complexity of the ℰ2 Grzegorczyk class
• On the analytic complexity of discriminants
• A numerical approach for computing Euler characteristics of affine varieties
• A polynomial generalization of the Euler characteristic for algebraic sets (with an appendix by J. V. Rennemo)

Describes a project that uses

Uses Software

• CSM-A

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1886973)