@inproceedings{gamard_et_al:LIPIcs.STACS.2021.32,
Address = {Dagstuhl, Germany},
Annote = {Keywords: Automata networks, Rice theorem, complexity classes, polynomial hierarchy, hardness},
Author = {Gamard, Guilhem and Guillon, Pierre and Perrot, Kevin and Theyssier, Guillaume},
BookTitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
Editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
File = {Rice-Like Theorems for Automata Network - LIPIcs-STACS-2021-32 - r.pdf},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
Pages = {32:1--32:17},
Publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{Rice-Like Theorems for Automata Networks}},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13677},
Volume = {187},
Year = {2021},
bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2021/13677},
bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.STACS.2021.32},
date-added = {2021-03-10 15:46:52 +0100},
date-modified = {2021-03-10 15:46:52 +0100},
urn = {urn:nbn:de:0030-drops-136770},
doi = {10.4230/LIPIcs.STACS.2021.32}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 07:51:09,
Build Time: N/A