The quantum and classical streaming complexity of quantum and classical Max-Cut

DOI10.1109/FOCS54457.2022.00054MaRDI QIDQ6943038zbMATH OpenFDO

Authors John Kallaugher, Ojas Parekh

Publication date 15 August 2025

Full work available at URL https://doi.org/10.1109/FOCS54457.2022.00054

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(1)

• Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case

This page was built for publication: The quantum and classical streaming complexity of quantum and classical Max-Cut

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