To access the full text documents, please follow this link: http://hdl.handle.net/2117/110969
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 | Ochremiak, Joanna |
dc.date | 2017 |
dc.identifier.citation | Atserias, A., Ochremiak, J. Proof complexity meets algebra. A: International Colloquium on Automata, Languages, and Programming. "44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)". Varsòvia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 110:1-110:14. |
dc.identifier.citation | 978-3-95977-041-5 |
dc.identifier.citation | 10.4230/LIPIcs.ICALP.2017.110 |
dc.identifier.uri | http://hdl.handle.net/2117/110969 |
dc.language.iso | eng |
dc.publisher | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
dc.relation | http://drops.dagstuhl.de/opus/volltexte/2017/7495 |
dc.relation | info:eu-repo/grantAgreement/EC/H2020/648276/EU/A Unified Theory of Algorithmic Relaxations/AUTAR |
dc.rights | Attribution 3.0 Spain |
dc.rights | info:eu-repo/semantics/openAccess |
dc.rights | http://creativecommons.org/licenses/by/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject | Algebra |
dc.subject | Machine theory |
dc.subject | Constraint satisfaction problem |
dc.subject | Proof complexity |
dc.subject | Reductions |
dc.subject | Gap theorems |
dc.subject | Àlgebra |
dc.subject | Màquines, Teoria de |
dc.title | Proof complexity meets algebra |
dc.type | info:eu-repo/semantics/publishedVersion |
dc.type | info:eu-repo/semantics/conferenceObject |
dc.description.abstract | |
dc.description.abstract |