How to compute the Chow form of an unmixed polynomial ideal in single exponential time

DOI10.1007/BF01810845zbMath0732.13012MaRDI QIDQ809149

Leandro Caniglia

Publication date: 1990

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

algorithm for eliminating form of an idealChow form of an unmixed polynomial idealélimination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Computational aspects and applications of commutative rings (13P99) Ideals and multiplicative ideal theory in commutative rings (13A15)

Related Items

Finding sparse systems of parameters, Sparse systems of parameters for determinantal varieties, Computation of differential Chow forms for ordinary prime differential ideals, Elimination for generic sparse polynomial systems, An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Definability and fast quantifier elimination in algebraically closed fields
• Bounds for the degrees in the Nullstellensatz
• Equations for the projective closure and effective Nullstellensatz
• ON ALGEBRAIC INDEPENDENCE OF ALGEBRAIC POWERS OF ALGEBRAIC NUMBERS
• ESTIMATES FOR THE CHARACTERISTIC FUNCTION OF A PRIME IDEAL
• Local Diophantine Nullstellen Inequalities
• ESTIMATES FOR THE ORDERS OF ZEROS OF FUNCTIONS OF A CERTAIN CLASS AND APPLICATIONS IN THE THEORY OF TRANSCENDENTAL NUMBERS