Computing higher graph gonality is hard

From MaRDI portal

Revision as of 09:41, 10 July 2024 by Import240710060729 (talk | contribs) (Created automatically from import240710060729)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6407158

Jump to:navigation, search

arXiv2208.03573MaRDI QIDQ6407158

Lucas Tolley, Ralph Morrison

Publication date: 6 August 2022

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Special divisors on curves (gonality, Brill-Noether theory) (14H51) Games on graphs (graph-theoretic aspects) (05C57)

This page was built for publication: Computing higher graph gonality is hard

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6407158&oldid=36071692"