scientific article; zbMATH DE number 7768354

DOI10.4230/LIPICS.APPROX/RANDOM.2021.9MaRDI QIDQ6090879zbMATH OpenFDO

Authors Karl Bringmann, Nick Fischer, Marvin Künnemann

Publication date 20 November 2023

Full work available at URL https://arxiv.org/abs/2107.01721

zbMATH Keywords

completenesshardness of approximation in Pdimensionality reductionsfine-grained complexity \& algorithm design

Mathematics Subject Classification ID

Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cited in

(3)

• Understanding PPA-completeness
• Understanding PPA-completeness
• From Optimality Robustness To Sufficiency and Completeness

This page was built for publication:

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