Name
Abstract | ||
|---|---|---|
The class TFNP was introduced a quarter of a century ago to capture problems in NP that have a witness for all inputs. A decade ago, this line of research culminated in the proof that the Nash equilibrium problem is complete for the subclass PPAD. Here we review some interesting developments since. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-57586-5_1 | ALGORITHMS AND COMPLEXITY (CIAC 2017) |
DocType | Volume | ISSN |
Conference | 10236 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul W. Goldberg | 1 | 0 | 0.34 |
| Christos H. Papadimitriou | 2 | 16671 | 3192.54 |