Volume 57, Issue 4December 2023Current Issue
Newsletter Downloads
Skip Table Of Content Section
research-article
On the Complexity of Chow and Hurwitz Forms
Pages 167–199https://doi.org/10.1145/3653002.3653003
We consider the bit complexity of computing Chow forms of projective varieties defined over integers and their generalization to multiprojective spaces. We develop a deterministic algorithm using resultants and obtain a single exponential complexity ...
research-article
A Proof of the Brill-Noether Method from Scratch
Pages 200–229https://doi.org/10.1145/3653002.3653004
In 1874 Brill and Noether designed a seminal geometric method for computing bases of Riemann-Roch spaces. From then, their method has led to several algorithms, some of them being implemented in computer algebra systems. The usual proofs often rely on ...
Subjects
Comments
Please enable JavaScript to view thecomments powered by Disqus.