On the complexity of Chow and Hurwitz forms

DOI10.1145/3653002.3653003MaRDI QIDQ6536635FDOQ6536635

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

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

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)