Computing p-presentation distances is hard

From MaRDI portal

Computing $p$-presentation distances is hard

Jump to:navigation, search

MaRDI QIDQ6525646arXivFDO

Authors Håvard Bakke Bjerkevik, Magnus Bakke Botnan

Published in arXiv

This page was built for publication: Computing $p$-presentation distances is hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6525646)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Computing_$p$-presentation_distances_is_hard&oldid=95440412"