Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/23412
dc.contributor.author | Foucaud, Florent |
---|---|
dc.contributor.author | Naserasr, Reza |
dc.date | 2014 |
dc.identifier.citation | Foucaud, F.; Naserasr, R. The complexity of homomorphisms of signed graphs and signed constraint satisfaction. A: Latin American Theoretical Informatics Symposium. "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)". Montevideo: 2014, p. 526-537. |
dc.identifier.citation | 978-364254422-4 |
dc.identifier.citation | 10.1007/978-3-642-54423-1_46 |
dc.identifier.uri | http://hdl.handle.net/2117/23412 |
dc.language.iso | eng |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial |
dc.subject | Theoretical computer science |
dc.subject | Artificial intelligence |
dc.subject | Computer science |
dc.subject | Computers |
dc.subject | Informàtica teòrica |
dc.title | The complexity of homomorphisms of signed graphs and signed constraint satisfaction |
dc.type | info:eu-repo/semantics/draft |
dc.type | info:eu-repo/semantics/conferenceObject |
dc.description.abstract | |
dc.description.abstract |