|
|||||
|
|
On the Complexity of Succinct Zero-Sum Games |
|
| Authors: | Lance Fortnow Russell Impagliazzo Valentine Kabanets Christopher Umans |
| Affiliation: | (1) Department of Computer Science, University of Chicago, Chicago, IL, USA;(2) Department of Computer Science, University of California – San Diego, La Jolla, CA, USA;(3) School of Computing Science, Simon Fraser University, Vancouver, BC, Canada;(4) Department of Computer Science, California Institute of Technology, Pasadena, CA, USA |
| Abstract: | |
| Keywords: | " target="_blank"> Succinct zero-sum games approximating the value of a zero-sum game completeness |
| 本文献已被 SpringerLink 等数据库收录！ | |