To access the full text documents, please follow this link: http://hdl.handle.net/2117/119165
dc.contributor | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
---|---|
dc.contributor.author | Chen, Yijia |
dc.contributor.author | Muller, Moritz Martin |
dc.contributor.author | Yokoyama, Keita |
dc.date | 2018 |
dc.identifier.citation | Chen, Y., Müller, M., Yokoyama, K. A parameterized halting problem, the linear time hierarchy, and the MRDP theorem. A: Annual ACM/IEEE Symposium on Logic in Computer Science. "LICS '18: proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science". New York: Association for Computing Machinery (ACM), 2018, p. 235-244. |
dc.identifier.citation | 978-1-4503-5583-4 |
dc.identifier.citation | 10.1145/3209108.3209155 |
dc.identifier.uri | http://hdl.handle.net/2117/119165 |
dc.language.iso | eng |
dc.publisher | Association for Computing Machinery (ACM) |
dc.relation | https://dl.acm.org/citation.cfm?doid=3209108.3209155 |
dc.relation | info:eu-repo/grantAgreement/EC/H2020/648276/EU/A Unified Theory of Algorithmic Relaxations/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 | Turing machines |
dc.subject | Computational complexity |
dc.subject | Turing, Màquines de |
dc.subject | Complexitat computacional |
dc.title | A parameterized halting problem, the linear time hierarchy, and the MRDP theorem |
dc.type | info:eu-repo/semantics/submittedVersion |
dc.type | info:eu-repo/semantics/conferenceObject |
dc.description.abstract | |
dc.description.abstract |