Checking History-Determinism is NP-hard for Parity Automata.
Aditya PrakashPublished in: FoSSaCS (1) (2024)
Keyphrases
- np hard
- scheduling problem
- cellular automata
- optimal solution
- linear programming
- lower bound
- approximation algorithms
- error correction
- np complete
- probabilistic automata
- remains np hard
- closely related
- np hardness
- greedy heuristic
- integer programming
- regular expressions
- minimum cost
- upper bound
- finite state machines
- finite automata
- historical information
- computational complexity
- markov chain
- finite state
- learning algorithm
- branch and bound algorithm
- computationally challenging
- special case