Searching for "On the Complexity of Succinct Zero-Sum Games." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

On the complexity of succinct zero-sum games
by Lance Fortnow, Valentine Kabanets, Russell Impagliazzo, Christopher Umans — 2005 — IEEE Conference on Computational Complexity
…On the Complexity of Succinct Zero-Sum Games Lance Fortnow ∗ Department of Computer Science…
Cited by 7 (0 self) – Add To MetaCart

On the Complexity of Succinct Zero-Sum Games
by unknown authors
… On the Complexity of Succinct Zero-Sum Games Lance Fortnow*Department of Computer Science…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB