596 citations · 3k across the 50 of their papers we have counts for
Showing 2002 · cs.CCShow all
2 papers · 2 filters
cs.CC2002★ 45 cited
Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory
Richard Lipton, Neal E. Young
Von Neumann's Min-Max Theorem guarantees that each player of a zero-sum matrix game has an optimal mixed strategy. This paper gives an elementary proof that each player has a near-…
cs.CC2002★ 29 cited
Lecture Notes on Evasiveness of Graph Properties
Laszlo Lovasz, Neal E. Young
This report presents notes from the first eight lectures of the class Many Models of Complexity taught by Laszlo Lovasz at Princeton University in the fall of 1990. The topic is ev…