Computing Chow Forms and Some Applications

@article{Jeronimo2001ComputingCF,
  title={Computing Chow Forms and Some Applications},
  author={Gabriela Jeronimo and Susana Puddu and Juan Sabia},
  journal={J. Algorithms},
  year={2001},
  volume={41},
  pages={52-68}
}
We prove the existence of an algorithm that, from a finite set of polynomials defining an algebraic projective variety, computes the Chow form of its equidimensional component of the greatest dimension. Applying this algorithm, a finite set of polynomials defining the equidimensional component of the greatest dimension of an algebraic (projective or affine) variety can be computed. The complexities of the algorithms involved are lower than the complexities of the known algorithms solving the… 
The Computational Complexity of the Chow Form
TLDR
A bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety that improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms.
The Boolean complexity of computing Chow forms
TLDR
A deterministic algorithm using resultants is developed, and a single exponential complexity upper bound is obtained, which represents the first Boolean complexity bound.
Computing generators of the ideal of a smooth affine algebraic variety
Algorithmes pour la décomposition primaire des idéaux polynomiaux de dimension nulle donnés en évaluation
Les algorithmes de resolution polynomiale sont impliques dans des outils sophistiques de calcul en geometrie algebrique aussi bien quen ingenierie. Les plus populaires dentre eux reposent sur des

References

SHOWING 1-10 OF 19 REFERENCES
A computational method for diophantine approximation
The procedures to solve algebraic geometry elimination problems have usually been designed from the point of view of commutative algebra. For instance, let us consider the problem of deciding whether
Basic algebraic geometry
The second volume of Shafarevich's introductory book on algebraic geometry focuses on schemes, complex algebraic varieties and complex manifolds. As with first volume the author has revised the text
An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
On Computing the Determinant in Small Parallel Time Using a Small Number of Processors
  • S. Berkowitz
  • Computer Science, Mathematics
    Inf. Process. Lett.
  • 1984
Vermeidung von Divisionen.
The extent to whieh the use of divisions may speed up the evaluation of polynomials is estimated from above. In particular it is shown that for multiplying general matrices the use of divisions does
Greatest common divisors of polynomials given by straight-line programs
TLDR
It is shown that most algebraic algorithms can be probabilistically applied to data that are given by a straight-line computation, and every degree-bounded rational function can be computed fast in parallel, that is, in polynomial size and polylogarithmic depth.
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
It is shown that the rank of a matrix over an arbitrary field can be computed inO(log2n) time using a polynomial number of processors.
Testing polynomials which are easy to compute (Extended Abstract)
TLDR
It is proved that given such a short, correct test sequence for W (d,n,v) the authors can efficiently construct a multivariate polynomial Pε@@@@ with deg(P) &equil; d and small integer coefficients such that P@@@@ W(d, n,v).
On the Computational Complexity of Polynomials and Bilinear Mappings. A Survey
This a r t i c l e is d e d i c a t e d to t h e s t u d y of t h e complex i ty of c o m p u t i n g a n d dec id ing s e l ec t ed p r o b l e m s in a lgebra , The m e t h o d s used he re a re a
...
...