@article{ journals/eccc/ECCC-TR04-012,
  added-at = {2013-01-14T00:00:00.000+0100},
  author = {Beame, Paul and Culberson, Joseph C. and Mitchell, David G. and Moore, Cristopher},
  biburl = {http://www.bibsonomy.org/bibtex/29311179443c9ed831db7b15ece50627a/dblp},
  ee = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-012/index.html},
  interhash = {3d2e6e6c4eea9e8663c317a96be482fc},
  intrahash = {9311179443c9ed831db7b15ece50627a},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  keywords = {dblp},
  number = {012},
  title = {The Resolution Complexity of Random Graph k-Colorability},
  url = {http://dblp.uni-trier.de/db/journals/eccc/eccc11.html#ECCC-TR04-012},
  year = {2004}
}

{"_id":"LDdseF6Q3JnMzDtBC","bibbaseid":"beame-culberson-mitchell-moore-theresolutioncomplexityofrandomgraphkcolorability-2004","downloads":0,"creationDate":"2015-03-12T16:55:35.668Z","title":"The Resolution Complexity of Random Graph k-Colorability","author_short":["Beame, P.","Culberson, J.<nbsp>C.","Mitchell, D.<nbsp>G.","Moore, C."],"year":2004,"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/moore?items=1000","bibdata":{"added-at":"2013-01-14T00:00:00.000+0100","author":["Beame, Paul","Culberson, Joseph C.","Mitchell, David G.","Moore, Cristopher"],"author_short":["Beame, P.","Culberson, J.<nbsp>C.","Mitchell, D.<nbsp>G.","Moore, C."],"bibtex":"@article{ journals/eccc/ECCC-TR04-012,\n added-at = {2013-01-14T00:00:00.000+0100},\n author = {Beame, Paul and Culberson, Joseph C. and Mitchell, David G. and Moore, Cristopher},\n biburl = {http://www.bibsonomy.org/bibtex/29311179443c9ed831db7b15ece50627a/dblp},\n ee = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-012/index.html},\n interhash = {3d2e6e6c4eea9e8663c317a96be482fc},\n intrahash = {9311179443c9ed831db7b15ece50627a},\n journal = {Electronic Colloquium on Computational Complexity (ECCC)},\n keywords = {dblp},\n number = {012},\n title = {The Resolution Complexity of Random Graph k-Colorability},\n url = {http://dblp.uni-trier.de/db/journals/eccc/eccc11.html#ECCC-TR04-012},\n year = {2004}\n}","bibtype":"article","biburl":"http://www.bibsonomy.org/bibtex/29311179443c9ed831db7b15ece50627a/dblp","ee":"http://eccc.hpi-web.de/eccc-reports/2004/TR04-012/index.html","id":"journals/eccc/ECCC-TR04-012","interhash":"3d2e6e6c4eea9e8663c317a96be482fc","intrahash":"9311179443c9ed831db7b15ece50627a","journal":"Electronic Colloquium on Computational Complexity (ECCC)","key":"journals/eccc/ECCC-TR04-012","keywords":"dblp","number":"012","title":"The Resolution Complexity of Random Graph k-Colorability","type":"article","url":"http://dblp.uni-trier.de/db/journals/eccc/eccc11.html#ECCC-TR04-012","year":"2004","bibbaseid":"beame-culberson-mitchell-moore-theresolutioncomplexityofrandomgraphkcolorability-2004","role":"author","urls":{"Link":"http://eccc.hpi-web.de/eccc-reports/2004/TR04-012/index.html","Paper":"http://dblp.uni-trier.de/db/journals/eccc/eccc11.html#ECCC-TR04-012"},"keyword":["dblp"],"downloads":0},"search_terms":["resolution","complexity","random","graph","colorability","beame","culberson","mitchell","moore"],"keywords":["dblp"],"authorIDs":[],"dataSources":["CNaPQFuj8cuTCPAK7"]}