TY - JOUR
T1 - La complexité du calcul de la caractéristique d'Euler des variétés complexes
AU - Bürgisser, Peter
AU - Cucker, Felipe
AU - Lotz, Martin
PY - 2004/9/1
Y1 - 2004/9/1
N2 - We extend one of the main results of Bürgisser and Cucker (http://www.arxiv.org/abs/cs/cs.CC/0312007, which asserts that the computation of the Euler characteristic of a semialgebraic set is complete in the counting complexity class FPℝ#Pℝ. The goal is to prove a similar result over ℂ: the computation of the Euler characteristic of an affine or projective complex variety is complete in the class FPℂ#Pℂ. © 2004 Académie des sciences. Published by Elsevier SAS. All rights reserved.
AB - We extend one of the main results of Bürgisser and Cucker (http://www.arxiv.org/abs/cs/cs.CC/0312007, which asserts that the computation of the Euler characteristic of a semialgebraic set is complete in the counting complexity class FPℝ#Pℝ. The goal is to prove a similar result over ℂ: the computation of the Euler characteristic of an affine or projective complex variety is complete in the class FPℂ#Pℂ. © 2004 Académie des sciences. Published by Elsevier SAS. All rights reserved.
UR - http://www.scopus.com/inward/record.url?scp=4444381933&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-4444381933&origin=recordpage
U2 - 10.1016/j.crma.2004.06.008
DO - 10.1016/j.crma.2004.06.008
M3 - RGC 21 - Publication in refereed journal
SN - 1631-073X
VL - 339
SP - 371
EP - 376
JO - Comptes Rendus Mathematique
JF - Comptes Rendus Mathematique
IS - 5
ER -