On the complexity of succinct zero-sum games. Fortnow, L., Impagliazzo, R., Kabanets, V., & Umans, C. Electronic Colloquium on Computational Complexity (ECCC) (ECCC), 2004.
On the complexity of succinct zero-sum games [link]Paper  bibtex   
@article{ dblp3961270,
  title = {On the complexity of succinct zero-sum games},
  author = {Lance Fortnow and Russell Impagliazzo and Valentine Kabanets and Christopher Umans},
  author_short = {Fortnow, L. and Impagliazzo, R. and Kabanets, V. and Umans, C.},
  bibtype = {article},
  type = {article},
  year = {2004},
  key = {dblp3961270},
  id = {dblp3961270},
  biburl = {http://www.dblp.org/rec/bibtex/journals/eccc/ECCC-TR04-001},
  url = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-001/index.html},
  journal = {Electronic Colloquium on Computational Complexity (ECCC) (ECCC)},
  number = {001},
  text = {Electronic Colloquium on Computational Complexity (ECCC) (ECCC)(001) (2004)}
}

Downloads: 0