To access the full text documents, please follow this link: http://hdl.handle.net/2117/126023
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 | Dawar, Anuj |
dc.date | 2018 |
dc.identifier.citation | Atserias, A., Dawar, A. Definable inapproximability: New challenges for duplicator. A: Annual Conference on Computer Science Logic. "27th EACSL Annual Conference on Computer Science Logic (CSL 2018): September 4-7, 2018, Birmingham, GB". Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 1-21. |
dc.identifier.citation | 978-3-95977-088-0 |
dc.identifier.citation | 10.4230/LIPIcs.CSL.2018.7 |
dc.identifier.uri | http://hdl.handle.net/2117/126023 |
dc.language.iso | eng |
dc.publisher | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
dc.relation | http://drops.dagstuhl.de/opus/volltexte/2018/9674/ |
dc.relation | info:eu-repo/grantAgreement/EC/H2020-648276-AUTAR |
dc.relation | info:eu-repo/grantAgreement/ES/1PE/TIN2013-48031-C4-1-P |
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 | Logic |
dc.subject | Algorithms |
dc.subject | Descriptive complexity |
dc.subject | Fixed-point logic with counting |
dc.subject | Hardness of approximation |
dc.subject | MAX SAT |
dc.subject | Vertex cover |
dc.subject | Lògica |
dc.subject | Algorismes |
dc.title | Definable inapproximability: New challenges for duplicator |
dc.type | info:eu-repo/semantics/publishedVersion |
dc.type | info:eu-repo/semantics/conferenceObject |
dc.description.abstract | |
dc.description.abstract |