pdf-format: |
|
@InProceedings{gamard_et_al:LIPIcs.STACS.2021.32, author = {Gamard, Guilhem and Guillon, Pierre and Perrot, Kevin and Theyssier, Guillaume}, title = {{Rice-Like Theorems for Automata Networks}}, booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)}, pages = {32:1--32:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-180-1}, ISSN = {1868-8969}, year = {2021}, volume = {187}, editor = {Bl\"{a}ser, Markus and Monmege, Benjamin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13677}, URN = {urn:nbn:de:0030-drops-136770}, doi = {10.4230/LIPIcs.STACS.2021.32}, annote = {Keywords: Automata networks, Rice theorem, complexity classes, polynomial hierarchy, hardness} }
Keywords: | Automata networks, Rice theorem, complexity classes, polynomial hierarchy, hardness | |
Seminar: | 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) | |
Issue date: | 2021 | |
Date of publication: | 10.03.2021 |