On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's.
Juraj HromkovicHolger PetersenGeorg SchnitgerPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- lower bound
- worst case
- space complexity
- upper bound
- computational complexity
- memory requirements
- average case complexity
- communication cost
- network size
- running times
- np hard
- objective function
- communication systems
- branch and bound
- complexity measures
- exponential size
- branch and bound algorithm
- communication networks
- communication channels
- query processing
- constant factor
- optimal cost
- finite state automata
- optimal solution