5 citations · 12 across the 11 of their papers we have counts for
Showing 2022 · cs.CCShow all
3 papers · 2 filters
cs.CC2022
On the Smoothed Complexity of Combinatorial Local Search
Yiannis Giannakopoulos, Alexander Grosz, Themistoklis Melissourgos
We propose a unifying framework for smoothed analysis of combinatorial local optimization problems, and show how a diverse selection of problems within the complexity class PLS can…
cs.CC2022★ 3 cited
Pure-Circuit: Tight Inapproximability for PPAD
Argyrios Deligkas, John Fearnley, Alexandros Hollender +1
The current state-of-the-art methods for showing inapproximability in PPAD arise from the -Generalized-Circuit (-GCircuit) problem. Rubinstein (2018) show…
cs.CC2022
Constant Inapproximability for PPA
Argyrios Deligkas, John Fearnley, Alexandros Hollender +1
In the -Consensus-Halving problem, we are given probability measures on the interval , and the goal is to partition into two parts…