Lower Bounds for Unambiguous Automata via Communication Complexity.
Mika GöösStefan KieferWeiqiang YuanPublished in: Electron. Colloquium Comput. Complex. (2022)
Keyphrases
- lower bound
- worst case
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- computational complexity
- np hard
- cellular automata
- lower and upper bounds
- average case complexity
- communication systems
- upper and lower bounds
- complexity measures
- information sharing
- neural network
- space complexity
- quadratic assignment problem
- lower bounding