On the complexity of Chow and Hurwitz forms
From MaRDI portal
Publication:6505505
DOI10.1145/3653002.3653003arXiv2202.11582MaRDI QIDQ6505505
Elias P. Tsigaridas, M. Doğan, Alperen Ali Ergur
Abstract: We consider the bit complexity of computing Chow forms and their generalization to multiprojective spaces. We develop a deterministic algorithm using resultants and obtain a single exponential complexity upper bound. Earlier computational results for Chow forms were in the arithmetic complexity model, and our result represents the first bit complexity bound. We also extend our algorithm to Hurwitz forms in projective space, and explore connections between multiprojective Hurwitz forms and matroid theory. The motivation for our work comes from incidence geometry where intriguing computational algebra problems remain open.
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 Q6505505)
