To access the full text documents, please follow this link: http://hdl.handle.net/2117/24254
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 | Creus López, Carles |
dc.contributor.author | Fernández Durán, Pau |
dc.contributor.author | Godoy Balil, Guillem |
dc.date | 2014 |
dc.identifier.citation | Creus, C.; Fernandez, P.; Godoy, G. Automatic evaluation of reductions between NP-complete problems. A: International Conference on Theory and Applications of Satisfiability Testing. "Theory and Applications of Satisfiability Testing : SAT 2014 : 17th International Conference, held as part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014 : Proceedings". Viena: Springer, 2014, p. 415-421. |
dc.identifier.citation | 978-3-319-09283-6 |
dc.identifier.citation | 10.1007/978-3-319-09284-3_30 |
dc.identifier.uri | http://hdl.handle.net/2117/24254 |
dc.language.iso | eng |
dc.publisher | Springer |
dc.relation | http://link.springer.com/chapter/10.1007%2F978-3-319-09284-3_30 |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Llenguatges de programació::Altres llenguatges de programació |
dc.subject | REDNP (Computer program language) |
dc.subject | NP-completeness |
dc.subject | Reductions |
dc.subject | SAT application |
dc.subject | Self- learning |
dc.subject | REDNP (Llenguatge de programació) |
dc.title | Automatic evaluation of reductions between NP-complete problems |
dc.type | info:eu-repo/semantics/publishedVersion |
dc.type | info:eu-repo/semantics/conferenceObject |
dc.description.abstract | |
dc.description.abstract |