Increasing Kolmogorov Complexity. Buhrman, H., Fortnow, L., Newman, I., & Vereshchagin, N. K. *Electronic Colloquium on Computational Complexity (ECCC) (ECCC)*, 2004. Paper bibtex @article{ dblp3961243,
title = {Increasing Kolmogorov Complexity},
author = {Harry Buhrman and Lance Fortnow and Ilan Newman and Nikolai K. Vereshchagin},
author_short = {Buhrman, H. and Fortnow, L. and Newman, I. and Vereshchagin, N. K.},
bibtype = {article},
type = {article},
year = {2004},
key = {dblp3961243},
id = {dblp3961243},
biburl = {http://www.dblp.org/rec/bibtex/journals/eccc/ECCC-TR04-081},
url = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-081/index.html},
journal = {Electronic Colloquium on Computational Complexity (ECCC) (ECCC)},
number = {081},
text = {Electronic Colloquium on Computational Complexity (ECCC) (ECCC)(081) (2004)}
}

Downloads: 0

{"_id":"WJBAqcGvCviaKkiEd","bibbaseid":"buhrman-fortnow-newman-vereshchagin-increasingkolmogorovcomplexity-2004","downloads":0,"creationDate":"2016-02-09T20:13:37.329Z","title":"Increasing Kolmogorov Complexity","author_short":["Buhrman, H.","Fortnow, L.","Newman, I.","Vereshchagin, N. K."],"year":2004,"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/eccc/ECCC-TR04-081","bibdata":{"title":"Increasing Kolmogorov Complexity","author":["Harry Buhrman","Lance Fortnow","Ilan Newman","Nikolai K. Vereshchagin"],"author_short":["Buhrman, H.","Fortnow, L.","Newman, I.","Vereshchagin, N. K."],"bibtype":"article","type":"article","year":"2004","key":"dblp3961243","id":"dblp3961243","biburl":"http://www.dblp.org/rec/bibtex/journals/eccc/ECCC-TR04-081","url":"http://eccc.hpi-web.de/eccc-reports/2004/TR04-081/index.html","journal":"Electronic Colloquium on Computational Complexity (ECCC) (ECCC)","number":"081","text":"Electronic Colloquium on Computational Complexity (ECCC) (ECCC)(081) (2004)","bibtex":"@article{ dblp3961243,\n title = {Increasing Kolmogorov Complexity},\n author = {Harry Buhrman and Lance Fortnow and Ilan Newman and Nikolai K. Vereshchagin},\n author_short = {Buhrman, H. and Fortnow, L. and Newman, I. and Vereshchagin, N. K.},\n bibtype = {article},\n type = {article},\n year = {2004},\n key = {dblp3961243},\n id = {dblp3961243},\n biburl = {http://www.dblp.org/rec/bibtex/journals/eccc/ECCC-TR04-081},\n url = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-081/index.html},\n journal = {Electronic Colloquium on Computational Complexity (ECCC) (ECCC)},\n number = {081},\n text = {Electronic Colloquium on Computational Complexity (ECCC) (ECCC)(081) (2004)}\n}","bibbaseid":"buhrman-fortnow-newman-vereshchagin-increasingkolmogorovcomplexity-2004","role":"author","urls":{"Paper":"http://eccc.hpi-web.de/eccc-reports/2004/TR04-081/index.html"},"downloads":0},"search_terms":["increasing","kolmogorov","complexity","buhrman","fortnow","newman","vereshchagin"],"keywords":[],"authorIDs":["56ba470d16a1deb95500038d"],"dataSources":["xrkvM5k6WCHpJwkRd"]}