"On the Computational Complexity of the Freezing Non-strict Majority Automata."

Eric Goles et al. (2017)

Details and statistics

DOI: 10.1007/978-3-319-58631-1_9

access: closed

type: Conference or Workshop Paper

metadata version: 2023-09-30

a service of  Schloss Dagstuhl - Leibniz Center for Informatics