On the complexity of counting components of algebraic varieties
From MaRDI portal
Publication:1030247
DOI10.1016/j.jsc.2008.02.009zbMath1169.14041OpenAlexW2102688174MaRDI QIDQ1030247
Peter Bürgisser, Peter Scheiblechner
Publication date: 1 July 2009
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2008.02.009
Symbolic computation and algebraic computation (68W30) Computational aspects of higher-dimensional varieties (14Q15) Parallel algorithms in computer science (68W10)
Related Items (5)
On a generalization of Stickelberger's theorem ⋮ Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties ⋮ Complexity of triangular representations of algebraic sets ⋮ Effective de Rham cohomology — The general case ⋮ On the multiplicity of isolated roots of sparse polynomial systems
Cites Work
- On computing the determinant in small parallel time using a small number of processors
- Definability and fast quantifier elimination in algebraically closed fields
- On the computation of Hilbert-Poincaré series
- The complexity of semilinear problems in succinct representation
- The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- Bounds for the degrees in the Nullstellensatz
- Basic principles of mechanical theorem proving in elementary geometries
- Gröbner bases and primary decomposition of polynomial ideals
- Résolution des systèmes d'équations algébriques
- A new method for solving algebraic systems of positive dimension
- Irreducible decomposition of algebraic varieties via characteristic sets and Gröbner bases
- Computation of Hilbert functions
- Direct methods for primary decomposition
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- Algorithmic properties of polynomial rings
- Some complexity results for polynomial ideals
- On the theories of triangular sets
- Prime decompositions of radicals in polynomial rings
- 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
- Associative differential operations
- Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen-Suslin) pour le Calcul Formel
- On Relating Time and Space to Size and Depth
- Sharp Effective Nullstellensatz
- What can be computed in algebraic geometry?
- Algorithms in real algebraic geometry
- Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the complexity of counting components of algebraic varieties
