Narrow Proofs May Be Maximally Long. Atserias, A., Lauria, M., & Nordström, J. Electron. Colloquium Comput. Complex., 21:118, 2014. Link Paper bibtex @article{journals/eccc/AtseriasLN14,
added-at = {2020-09-08T00:00:00.000+0200},
author = {Atserias, Albert and Lauria, Massimo and Nordström, Jakob},
biburl = {https://www.bibsonomy.org/bibtex/2b6a1b96dba9f03f3c385a412122070a9/dblp},
ee = {http://eccc.hpi-web.de/report/2014/118},
interhash = {cccf01c30b73aa250e88a6eb8f29b504},
intrahash = {b6a1b96dba9f03f3c385a412122070a9},
journal = {Electron. Colloquium Comput. Complex.},
keywords = {dblp},
pages = 118,
timestamp = {2020-09-09T12:35:16.000+0200},
title = {Narrow Proofs May Be Maximally Long.},
url = {http://dblp.uni-trier.de/db/journals/eccc/eccc21.html#AtseriasLN14},
volume = 21,
year = 2014
}
Downloads: 0
{"_id":"hBdAboXxR2LjMG2Fp","bibbaseid":"atserias-lauria-nordstrm-narrowproofsmaybemaximallylong-2014","downloads":0,"creationDate":"2016-02-18T17:10:54.998Z","title":"Narrow Proofs May Be Maximally Long.","author_short":["Atserias, A.","Lauria, M.","Nordström, J."],"year":2014,"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/massimo?items=1000","bibdata":{"bibtype":"article","type":"article","added-at":"2020-09-08T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Atserias"],"firstnames":["Albert"],"suffixes":[]},{"propositions":[],"lastnames":["Lauria"],"firstnames":["Massimo"],"suffixes":[]},{"propositions":[],"lastnames":["Nordström"],"firstnames":["Jakob"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2b6a1b96dba9f03f3c385a412122070a9/dblp","ee":"http://eccc.hpi-web.de/report/2014/118","interhash":"cccf01c30b73aa250e88a6eb8f29b504","intrahash":"b6a1b96dba9f03f3c385a412122070a9","journal":"Electron. Colloquium Comput. Complex.","keywords":"dblp","pages":"118","timestamp":"2020-09-09T12:35:16.000+0200","title":"Narrow Proofs May Be Maximally Long.","url":"http://dblp.uni-trier.de/db/journals/eccc/eccc21.html#AtseriasLN14","volume":"21","year":"2014","bibtex":"@article{journals/eccc/AtseriasLN14,\n added-at = {2020-09-08T00:00:00.000+0200},\n author = {Atserias, Albert and Lauria, Massimo and Nordström, Jakob},\n biburl = {https://www.bibsonomy.org/bibtex/2b6a1b96dba9f03f3c385a412122070a9/dblp},\n ee = {http://eccc.hpi-web.de/report/2014/118},\n interhash = {cccf01c30b73aa250e88a6eb8f29b504},\n intrahash = {b6a1b96dba9f03f3c385a412122070a9},\n journal = {Electron. Colloquium Comput. Complex.},\n keywords = {dblp},\n pages = 118,\n timestamp = {2020-09-09T12:35:16.000+0200},\n title = {Narrow Proofs May Be Maximally Long.},\n url = {http://dblp.uni-trier.de/db/journals/eccc/eccc21.html#AtseriasLN14},\n volume = 21,\n year = 2014\n}\n\n","author_short":["Atserias, A.","Lauria, M.","Nordström, J."],"key":"journals/eccc/AtseriasLN14","id":"journals/eccc/AtseriasLN14","bibbaseid":"atserias-lauria-nordstrm-narrowproofsmaybemaximallylong-2014","role":"author","urls":{"Link":"http://eccc.hpi-web.de/report/2014/118","Paper":"http://dblp.uni-trier.de/db/journals/eccc/eccc21.html#AtseriasLN14"},"keyword":["dblp"],"downloads":0},"search_terms":["narrow","proofs","maximally","long","atserias","lauria","nordström"],"keywords":["dblp"],"authorIDs":[],"dataSources":["3K8QdNFi6YEcLKp3r"]}