📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Pure-Circuit: Tight Inapproximability for PPAD (2024)

First Author: Deligkas A

Attributed to: New Techniques for Resolving Boundary Problems in Total Search funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1145/3678166

Publication URI: http://dx.doi.org/10.1145/3678166

Type: Journal Article/Review

Parent Publication: Journal of the ACM

Issue: 5