Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
FOCS
/
Paper
Settling the Complexity of Computing Approximate Two-Player Nash Equilibria.
Aviad Rubinstein
Venue
A*
FOCS
Year
2016
Proceedings
FOCS
DBLP record
conf/focs/Rubinstein16 ↗
Browse the full
FOCS paper archive
.