Narrow Proofs May Be Maximally Long. Atserias, A., Lauria, M., & Nordström, J. Electron. Colloquium Comput. Complex., 21:118, 2014.
Narrow Proofs May Be Maximally Long. [link]Link  Narrow Proofs May Be Maximally Long. [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