On a generalization of Stickelberger's theorem

DOI10.1016/j.jsc.2010.06.020zbMath1211.14065OpenAlexW2070624034MaRDI QIDQ607067

Peter Scheiblechner

Publication date: 19 November 2010

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2010.06.020

zbMATH Keywords

complexityalgorithmsconnected componentsalgebraic varietiesirreducible components

Mathematics Subject Classification ID

Computational aspects of higher-dimensional varieties (14Q15) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Related Items (6)

Effective approximation of the solutions of algebraic equations ⋮ Stickelberger and the Eigenvalue Theorem ⋮ Reaching generalized critical values of a polynomial ⋮ Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties ⋮ Atypical points at infinity and algorithmic detection of the bifurcation locus of real polynomials ⋮ Effective de Rham cohomology — The general case

Cites Work

• 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
• Counting irreducible components of complex algebraic varieties
• Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
• On computing the determinant in small parallel time using a small number of processors
• A generalization of Stickelberger's theorem
• On the complexity of counting components of algebraic varieties
• Fast parallel absolute irreducibility testing
• A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
• Bounds for the degrees in the Nullstellensatz
• Some tapas of computer algebra
• Effective equidimensional decomposition of affine varieties
• The computational complexity of the Chow form
• On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
• Lifting and recombination techniques for absolute factorization
• Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
• On the effective Nullstellensatz
• Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen-Suslin) pour le Calcul Formel
• Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
• Factoring Rational Polynomials over the Complex Numbers
• The Space Complexity of Elimination Theory: Upper Bounds
• Sharp Effective Nullstellensatz
• Factoring multivariate polynomials via partial differential equations
• Algorithms in real algebraic geometry

This page was built for publication: On a generalization of Stickelberger's theorem