First Page | Document Content | |
---|---|---|
Date: 2005-06-21 20:41:38 | On the Complexity of Succinct Zero-Sum Games Lance Fortnow∗ Department of Computer Science University of Chicago Chicago, IL USAAdd to Reading ListSource URL: users.cms.caltech.eduDownload Document from Source WebsiteFile Size: 225,66 KBShare Document on Facebook |