On the complexity of Chow and Hurwitz forms

DOI10.1145/3653002.3653003MaRDI QIDQ6536635zbMATH OpenFDO

Authors M. Levent Doğan, Alperen Ali Ergur, Elias P. Tsigaridas

Publication date 13 May 2024

Published in ACM Communications in Computer Algebra (Search for Journal in Brave)

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites work

• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 3611475 (Why is no real title available?)
• scientific article; zbMATH DE number 575960 (Why is no real title available?)
• scientific article; zbMATH DE number 704831 (Why is no real title available?)
• scientific article; zbMATH DE number 1446863 (Why is no real title available?)
• scientific article; zbMATH DE number 967398 (Why is no real title available?)
• 3264 and all that. A second course in algebraic geometry
• A numerical toolkit for multiprojective varieties
• A subdivision-based algorithm for the sparse resultant
• Algorithms in invariant theory
• Algorithms in real algebraic geometry
• An algorithm for the Rota straightening formula
• Beweis und Verschärfung eines Satzes von Kronecker
• Binary segmentation for multivariate polynomials
• Bivariate triangular decompositions in the presence of asymptotes
• Chow polytopes and general resultants
• Coisotropic hypersurfaces in Grassmannians
• Computing Chow forms and some applications
• Generalised characteristic polynomials
• How to compute the Chow form of an unmixed polynomial ideal in single exponential time
• Macaulay style formulas for sparse resultants
• Multigraded Cayley-Chow forms
• On Hilbert's function, series of composition of ideals and a generalisation of the theorem of Bézout.
• On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection
• On the bit complexity of polynomial system solving
• On the complexity of computing determinants
• On the complexity of the multivariate resultant
• On the intrinsic complexity of elimination theory
• On the time-space complexity of geometric elimination procedures
• Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic
• Separation bounds for polynomial systems
• Solving degenerate sparse polynomial systems faster
• Solving polynomial equations. Foundations, algorithms, and applications
• Sparse Rational Univariate Representation
• The Hurwitz form of a projective variety
• The Multivariate Schwartz--Zippel Lemma
• The computational complexity of the Chow form
• The hardness of polynomial equation solving
• The height of the mixed sparse resultant
• The shifted number system for fast linear algebra on integer matrices
• When are multidegrees positive?
• Zur algebraischen Geometrie. IX. Über zugeordnete Formen und algebraische Systeme von algebraischen Mannigfaltigkeiten

Cited in

(1)

• A short proof for the parameter continuation theorem

This page was built for publication: On the complexity of Chow and Hurwitz forms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536635)