Pure-Circuit: tight inapproximability for PPAD
<p>The current state-of-the-art methods for showing inapproximability in <span data-="">PPAD</span> arise from the ε-Generalized-Circuit (ε-<span data-="">GCircuit</span>) problem. Rubinstein (2018) showed th...
Main Authors: | , , , |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Association for Computing Machinery
2024
|