A structural investigation of the approximability of polynomial-time problems

DOI10.4230/LIPICS.ICALP.2022.30MaRDI QIDQ6560816

Marvin Künnemann, Nick Fischer, Author name not available (Why is that?), Karl Bringmann

Publication date: 24 June 2024

zbMATH Keywords

classification theoremsfine-grained complexity theoryhardness of approximation in P

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

This page was built for publication: A structural investigation of the approximability of polynomial-time problems

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