To access the full text documents, please follow this link: http://hdl.handle.net/2117/24406
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 | 2014 |
dc.identifier.citation | Atserias, A.; Lauria, M.; Nordström, J. Narrow proofs may be maximally long. A: IEEE Conference on Computational Complexity. "IEEE 29th Conference on Computational Complexity: 11-13 June 2014, Vancouver, British Columbia, Canada: proceedings". Vancouver: Institute of Electrical and Electronics Engineers (IEEE), 2014, p. 286-297. |
dc.identifier.citation | 978-1-4799-3626-7 |
dc.identifier.citation | 10.1109/CCC.2014.36 |
dc.identifier.uri | http://hdl.handle.net/2117/24406 |
dc.language.iso | eng |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) |
dc.relation | http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6875497 |
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 | Degree |
dc.subject | Lasserre |
dc.subject | Length |
dc.subject | PCR |
dc.subject | Polynomial calculus |
dc.subject | Proof complexity |
dc.subject | Rank |
dc.subject | Resolution |
dc.subject | Sherali-Adams |
dc.subject | Size |
dc.subject | Width |
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/conferenceObject |
dc.description.abstract |