@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)}
}

{"_id":"oxAyhuSAqrbmaWXPd","bibbaseid":"fortnow-impagliazzo-kabanets-umans-onthecomplexityofsuccinctzerosumgames-2004","downloads":0,"creationDate":"2016-02-09T20:13:37.334Z","title":"On the complexity of succinct zero-sum games","author_short":["Fortnow, L.","Impagliazzo, R.","Kabanets, V.","Umans, C."],"year":2004,"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/eccc/ECCC-TR04-001","bibdata":{"title":"On the complexity of succinct zero-sum games","author":["Lance Fortnow","Russell Impagliazzo","Valentine Kabanets","Christopher Umans"],"author_short":["Fortnow, L.","Impagliazzo, R.","Kabanets, V.","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)","bibtex":"@article{ dblp3961270,\n title = {On the complexity of succinct zero-sum games},\n author = {Lance Fortnow and Russell Impagliazzo and Valentine Kabanets and Christopher Umans},\n author_short = {Fortnow, L. and Impagliazzo, R. and Kabanets, V. and Umans, C.},\n bibtype = {article},\n type = {article},\n year = {2004},\n key = {dblp3961270},\n id = {dblp3961270},\n biburl = {http://www.dblp.org/rec/bibtex/journals/eccc/ECCC-TR04-001},\n url = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-001/index.html},\n journal = {Electronic Colloquium on Computational Complexity (ECCC) (ECCC)},\n number = {001},\n text = {Electronic Colloquium on Computational Complexity (ECCC) (ECCC)(001) (2004)}\n}","bibbaseid":"fortnow-impagliazzo-kabanets-umans-onthecomplexityofsuccinctzerosumgames-2004","role":"author","urls":{"Paper":"http://eccc.hpi-web.de/eccc-reports/2004/TR04-001/index.html"},"downloads":0},"search_terms":["complexity","succinct","zero","sum","games","fortnow","impagliazzo","kabanets","umans"],"keywords":[],"authorIDs":["56ba470d16a1deb95500038d"],"dataSources":["jjfuRjDeTNpy6cCao"]}