Abstract
We revisit the seminal Brill–Noether algorithm for plane curves with ordinary singularities. Our new approach takes advantage of fast algorithms for polynomials and structured matrices. We design a new probabilistic algorithm of Las Vegas type that computes a Riemann–Roch space in expected sub-quadratic time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have