Back to Results
First PageMeta Content
Computational complexity theory / Theory of computation / Complexity classes / NP / Clique problem / Linear programming / P / Algorithm / Time complexity / Optimization problem / Book:Graph Theory / P versus NP problem


CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time
Add to Reading List

Document Date: 2014-01-06 16:13:01

Open Document

File Size: 174,26 KB

Share Result on Facebook
UPDATE