@inproceedings{ dblp2307635,
  title = {On the Complexity of Finding Narrow Proofs},
  author = {Christoph Berkholz},
  author_short = {Berkholz, C.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2012},
  key = {dblp2307635},
  id = {dblp2307635},
  biburl = {http://www.dblp.org/rec/bibtex/conf/focs/Berkholz12},
  url = {http://dx.doi.org/10.1109/FOCS.2012.48},
  conference = {FOCS},
  pages = {351-360},
  text = {FOCS 2012:351-360},
  booktitle = {Proceedings of Foundations of Computer Science (FOCS)}
}

{"_id":"bXcrKAj8KL8Hqfb4F","bibbaseid":"berkholz-onthecomplexityoffindingnarrowproofs-2012","downloads":0,"creationDate":"2015-09-23T09:34:06.389Z","title":"On the Complexity of Finding Narrow Proofs","author_short":["Berkholz, C."],"year":2012,"bibtype":"inproceedings","biburl":"http://www.dblp.org/rec/bibtex/conf/focs/Berkholz12","bibdata":{"title":"On the Complexity of Finding Narrow Proofs","author":["Christoph Berkholz"],"author_short":["Berkholz, C."],"bibtype":"inproceedings","type":"inproceedings","year":"2012","key":"dblp2307635","id":"dblp2307635","biburl":"http://www.dblp.org/rec/bibtex/conf/focs/Berkholz12","url":"http://dx.doi.org/10.1109/FOCS.2012.48","conference":"FOCS","pages":"351-360","text":"FOCS 2012:351-360","booktitle":"Proceedings of Foundations of Computer Science (FOCS)","bibtex":"@inproceedings{ dblp2307635,\n title = {On the Complexity of Finding Narrow Proofs},\n author = {Christoph Berkholz},\n author_short = {Berkholz, C.},\n bibtype = {inproceedings},\n type = {inproceedings},\n year = {2012},\n key = {dblp2307635},\n id = {dblp2307635},\n biburl = {http://www.dblp.org/rec/bibtex/conf/focs/Berkholz12},\n url = {http://dx.doi.org/10.1109/FOCS.2012.48},\n conference = {FOCS},\n pages = {351-360},\n text = {FOCS 2012:351-360},\n booktitle = {Proceedings of Foundations of Computer Science (FOCS)}\n}","bibbaseid":"berkholz-onthecomplexityoffindingnarrowproofs-2012","role":"author","urls":{"Paper":"http://dx.doi.org/10.1109/FOCS.2012.48"},"downloads":0,"html":""},"search_terms":["complexity","finding","narrow","proofs","berkholz"],"keywords":[],"authorIDs":[],"dataSources":["JrdHTwZrgw4ix9udL"]}