Items where Author is "Fearnley, John"

Article

Deligkas, Argyrios and Fearnley, John and Melissourgos, Themistoklis and Spirakis, Paul G (2022) Approximating the existential theory of the reals. Journal of Computer and System Sciences, 125. pp. 106-128. DOI https://doi.org/10.1016/j.jcss.2021.11.002

Monograph

Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2022) Pure-Circuit: Strong Inapproximability for PPAD. Working Paper. arXiv. (Unpublished)

Conference or Workshop Item

Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2023) Tight Inapproximability for Graphical Games. In: 37th AAAI Conference on Artificial Intelligence, 2023-02-07 - 2023-02-14, Washington DC, USA.

Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2022) Pure-Circuit: Strong Inapproximability for PPAD. In: FOCS 2022: 63rd IEEE Symposium on Foundations of Computer Science, 2022-10-31 - 2022-11-03, Denver, Colorado.

Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2022) Constant Inapproximability for PPA. In: STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022-06-20 - 2022-06-24, Rome, Italy.