Skip to main navigation Skip to search Skip to main content

Sub-quadratic time for riemann-roch spaces: Case of smooth divisors over nodal plane projective curves

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We revisit the seminal Brill-Noether algorithm in the rather generic situation of smooth divisors over a nodal plane projective curve. Our approach takes advantage of fast algorithms for polynomials and structured matrices. We reach sub-quadratic time for computing a basis of a Riemann-Roch space. This improves upon previously known complexity bounds.

Original languageEnglish
Title of host publicationISSAC 2020 - Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation
EditorsAngelos Mantzaflaris
PublisherAssociation for Computing Machinery
Pages14-21
Number of pages8
ISBN (Electronic)9781450371001
DOIs
Publication statusPublished - 20 Jul 2020
Event45th International Symposium on Symbolic and Algebraic Computation, ISSAC 2020 - Kalamata, Virtual, Greece
Duration: 20 Jul 202023 Jul 2020

Publication series

NameProceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Conference

Conference45th International Symposium on Symbolic and Algebraic Computation, ISSAC 2020
Country/TerritoryGreece
CityKalamata, Virtual
Period20/07/2023/07/20

Keywords

  • algebraic curves
  • complexity
  • riemann-roch spaces

Fingerprint

Dive into the research topics of 'Sub-quadratic time for riemann-roch spaces: Case of smooth divisors over nodal plane projective curves'. Together they form a unique fingerprint.

Cite this