Counting irreducible components of complex algebraic varieties
DOI10.1007/S00037-009-0283-3zbMATH Open1204.14030OpenAlexW2073870042MaRDI QIDQ623497FDOQ623497
Authors: Peter Bürgisser, Peter Scheiblechner 
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
Recommendations
- On the complexity of counting components of algebraic varieties
- On the complexity of counting irreducible components and computing Betti numbers of algebraic varieties
- scientific article; zbMATH DE number 5494023
- A deterministic polynomial-time algorithm for the first Bertini theorem. I
- On a generalization of Stickelberger's theorem
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational aspects of higher-dimensional varieties (14Q15)
Cited In (10)
- Extended Hilbert Irreducibility and Its Applications
- Irreducible discriminant components of coefficient spaces
- Finding irreducible components of some real transcendental varieties
- Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties
- Sparse systems of parameters for determinantal varieties
- Title not available (Why is that?)
- On a generalization of Stickelberger's theorem
- On computing absolutely irreducible components of algebraic varieties with parameters
- On the complexity of counting components of algebraic varieties
- On the complexity of counting irreducible components and computing Betti numbers of algebraic varieties
This page was built for publication: Counting irreducible components of complex algebraic varieties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623497)
