Conference item
TFNP: An update
- 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 equilib-rium problem is complete for the subclass PPAD. Here we review some interesting developments since.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 204.6KB, Terms of use)
-
- Publisher copy:
- 10.1007/978-3-319-57586-5_1
Authors
- Publisher:
- Springer
- Host title:
- International Conference on Algorithms and Complexity, CIAC 2017
- Journal:
- International Conference on Algorithms and Complexity, CIAC 2017 More from this journal
- Publication date:
- 2017-04-01
- Acceptance date:
- 2016-12-20
- DOI:
- ISSN:
-
1611-3349 and 0302-9743
- ISBN:
- 9783319575858
- Pubs id:
-
pubs:697104
- UUID:
-
uuid:02ed473c-a711-465d-844e-76cde692921f
- Local pid:
-
pubs:697104
- Source identifiers:
-
697104
- Deposit date:
-
2017-05-31
Terms of use
- Copyright holder:
- Springer International Publishing AG
- Copyright date:
- 2017
- Notes:
- © Springer International Publishing AG 2017
If you are the owner of this record, you can report an update to it here: Report update to this record