Counting irreducible components of complex algebraic varieties

DOI10.1007/s00037-009-0283-3zbMath1204.14030OpenAlexW2073870042MaRDI QIDQ623497

Peter Scheiblechner, Peter Bürgisser

Publication date: 7 February 2011

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-009-0283-3

zbMATH Keywords

complexityalgebraic varietiesirreducible componentsbertini's theorem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Computational aspects of higher-dimensional varieties (14Q15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

On a generalization of Stickelberger's theorem ⋮ Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties

This page was built for publication: Counting irreducible components of complex algebraic varieties