On the complexity of counting components of algebraic varieties
type: Item
instance of: scholarly article
title: On the complexity of counting components of algebraic varieties
zbMATH Open document ID: 1169.14041
author: Peter Bürgisser
author: Peter Scheiblechner
published in: Journal of Symbolic Computation
publication date: 2009-07-01T00:00:00Z
Mathematics Subject Classification ID: 14Q15
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 5573844
zbMATH Keywords: characteristic sets
zbMATH Keywords: complexity
zbMATH Keywords: connected components
zbMATH Keywords: differential forms
zbMATH Keywords: irreducible components
MaRDI profile type: Publication
full work available at URL: j.jsc.2008.02.009
OpenAlex ID: W2102688174
cites work: On the theories of triangular sets
cites work: Algorithms in real algebraic geometry
cites work: What can be computed in algebraic geometry?
cites work: Computation of Hilbert functions
cites work: On computing the determinant in small parallel time using a small number of processors
cites work: On the computation of Hilbert-Poincaré series
cites work: On Relating Time and Space to Size and Depth
cites work: Q3568131
cites work: Bounds for the degrees in the Nullstellensatz
cites work: Q5465357
cites work: Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
cites work: The complexity of semilinear problems in succinct representation
cites work: The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties
cites work: Q5301652
cites work: Q5184990
cites work: Q4209232
cites work: Q4317713
cites work: Direct methods for primary decomposition
cites work: Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen-Suslin) pour le Calcul Formel
cites work: Q4725742
cites work: Gröbner bases and primary decomposition of polynomial ideals
cites work: Q3973337
cites work: Q5184991
cites work: Q4002797
cites work: Q4143433
cites work: Definability and fast quantifier elimination in algebraically closed fields
cites work: A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
cites work: Prime decompositions of radicals in polynomial rings
cites work: Algorithmic properties of polynomial rings
cites work: Sharp Effective Nullstellensatz
cites work: Q3869440
cites work: Résolution des systèmes d'équations algébriques
cites work: A new method for solving algebraic systems of positive dimension
cites work: Some complexity results for polynomial ideals
cites work: Q3695369
cites work: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
cites work: Q4128900
cites work: Associative differential operations
cites work: On the complexity of counting irreducible components and computing Betti numbers of algebraic varieties
cites work: On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
cites work: Q4135685
cites work: Q3744271
cites work: Q4227013
cites work: Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
cites work: Irreducible decomposition of algebraic varieties via characteristic sets and Gröbner bases
cites work: Basic principles of mechanical theorem proving in elementary geometries
DOI: 10.1016/J.JSC.2008.02.009
description: scientific article; zbMATH DE number 5573844