Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/134848
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 | Kolaitis, Phokion |
dc.contributor.author | Severini, Simone |
dc.date | 2019-09 |
dc.identifier.citation | Atserias, A.; Kolaitis, P.; Severini, S. Generalized satisfiability problems via operator assignments. "Journal of computer and system sciences", vol. 105, Novembre 2019, p. 171-198. |
dc.identifier.citation | 0022-0000 |
dc.identifier.citation | 10.1016/j.jcss.2019.05.003 |
dc.identifier.uri | http://hdl.handle.net/2117/134848 |
dc.language.iso | eng |
dc.relation | https://www.sciencedirect.com/science/article/pii/S0022000019300406 |
dc.relation | info:eu-repo/grantAgreement/EC/H2020/648276/EU/A Unified Theory of Algorithmic Relaxations/AUTAR |
dc.relation | info:eu-repo/grantAgreement/ES/1PE/TIN2013-48031-C4-1-P |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights | info:eu-repo/semantics/openAccess |
dc.rights | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject | Logic, Symbolic and mathematical |
dc.subject | Computational complexity |
dc.subject | Constraint satisfaction problem |
dc.subject | Quantum satisfiability |
dc.subject | Non-local games |
dc.subject | Dichotomy theorems |
dc.subject | Linear operators |
dc.subject | Undecidable problems |
dc.subject | pp-definitions |
dc.subject | Lògica matemàtica |
dc.subject | Complexitat computacional |
dc.title | Generalized satisfiability problems via operator assignments |
dc.type | info:eu-repo/semantics/publishedVersion |
dc.type | info:eu-repo/semantics/article |
dc.description.abstract | |
dc.description.abstract |