To access the full text documents, please follow this link: http://hdl.handle.net/2117/99737
dc.contributor | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
---|---|
dc.contributor | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
dc.contributor.author | Atserias, Albert |
dc.contributor.author | Lauria, Massimo |
dc.contributor.author | Nordström, Jakob |
dc.date | 2016-07-03 |
dc.identifier.citation | Atserias, A., Lauria, M., Nordström, J. Narrow proofs may be maximally long. "ACM transactions on computational logic", 3 Juliol 2016, vol. 17, núm. 3, p. 19:1-19:30. |
dc.identifier.citation | 1529-3785 |
dc.identifier.citation | 10.1145/2898435 |
dc.identifier.uri | http://hdl.handle.net/2117/99737 |
dc.language.iso | eng |
dc.relation | http://dl.acm.org/citation.cfm?doid=2894199.2898435 |
dc.relation | info:eu-repo/grantAgreement/ES/1PE/TIN2013-48031-C4-1-P |
dc.relation | info:eu-repo/grantAgreement/EC/FP7/279611/EU/Understanding the Hardness of Theorem Proving/UTHOTP |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject | Computational complexity |
dc.subject | Proof complexity |
dc.subject | Resolution |
dc.subject | Width |
dc.subject | Polynomial calculus |
dc.subject | Polynomial calculus resolution |
dc.subject | PCR |
dc.subject | Sherali-Adams |
dc.subject | SAR |
dc.subject | Degree |
dc.subject | Complexitat computacional |
dc.title | Narrow proofs may be maximally long |
dc.type | info:eu-repo/semantics/submittedVersion |
dc.type | info:eu-repo/semantics/article |
dc.description.abstract | |
dc.description.abstract |