Pure-circuit: strong inapproximability for PPAD
The current state-of-the-art methods for showing inapproximability in PPAD arise from the ε-Generalized-Circuit (ε-GCircuit) problem. Rubinstein (2018) showed that there exists a small unknown constant ε for which ε-GCircuit is PPAD-hard, and subsequent work has shown hardness results for other prob...
| Κύριοι συγγραφείς: | , , , |
|---|---|
| Μορφή: | Conference item |
| Γλώσσα: | English |
| Έκδοση: |
IEEE
2022
|