Lower Bounds for Unambiguous Automata via Communication Complexity.
Mika GöösStefan KieferWeiqiang YuanPublished in: ICALP (2022)
Keyphrases
- lower bound
- worst case
- upper bound
- objective function
- branch and bound
- average case complexity
- computational complexity
- decision problems
- information sharing
- lower bounding
- communication systems
- cellular automata
- computational cost
- np hard
- neural network
- branch and bound algorithm
- regular expressions
- space complexity
- vc dimension
- communication protocol
- quadratic assignment problem
- optimal solution
- learning algorithm