Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/123124
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 | Bonacina, Ilario |
dc.contributor.author | Rezende, Susanna F. de |
dc.contributor.author | Lauria, Massimo |
dc.contributor.author | Nordström, Jakob |
dc.contributor.author | Razborov, Alexander |
dc.date | 2018 |
dc.identifier.citation | Atserias, A., Bonacina, I., Rezende, S., Lauria, M., Nordström, J., Razborov, A. Clique is hard on average for regular resolution. A: ACM Symposium on Theory of Computing. "Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing". New York: Association for Computing Machinery (ACM), 2018, p. 866-877. |
dc.identifier.citation | 978-1-4503-5559-9 |
dc.identifier.citation | 10.1145/3188745.3188856 |
dc.identifier.uri | http://hdl.handle.net/2117/123124 |
dc.language.iso | eng |
dc.publisher | Association for Computing Machinery (ACM) |
dc.relation | https://dl.acm.org/citation.cfm?doid=3188745.3188856 |
dc.relation | info:eu-repo/grantAgreement/EC/H2020-648276-AUTAR |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat |
dc.subject | Computational complexity |
dc.subject | Algorithms |
dc.subject | Proof complexity |
dc.subject | Regular resolution |
dc.subject | k-clique |
dc.subject | Erdos-Rényi random graphs |
dc.subject | Complexitat computacional |
dc.subject | Algorismes |
dc.title | Clique is hard on average for regular resolution |
dc.type | info:eu-repo/semantics/submittedVersion |
dc.type | info:eu-repo/semantics/conferenceObject |
dc.description.abstract | |
dc.description.abstract |