On the hardness of PosSLP

DOI10.1137/1.9781611977912.75MaRDI QIDQ6645434zbMATH OpenFDO

Authors Peter Bürgisser, Gorav Jindal

Publication date 28 November 2024

Full work available at URL https://doi.org/10.1137/1.9781611977912.75

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• PosSLP and sum of squares

This page was built for publication: On the hardness of PosSLP

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