Lower Bounds on Unambiguous Automata Complementation and Separation via Communication Complexity.
Mika GöösStefan KieferPublished in: CoRR (2021)
Keyphrases
- lower bound
- worst case
- upper bound
- cellular automata
- communication systems
- space complexity
- computational complexity
- np hard
- neural network
- average case complexity
- branch and bound algorithm
- finite state machines
- quadratic assignment problem
- complexity measures
- set of randomly generated instances
- information sharing
- computational cost