Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach.
Farid M. AblayevPublished in: LFCS (1994)
Keyphrases
- space complexity
- lower bound
- worst case
- upper bound
- arc consistency
- branch and bound algorithm
- branch and bound
- worst case time complexity
- upper and lower bounds
- generative model
- probabilistic model
- objective function
- space requirements
- optimal solution
- lower and upper bounds
- finite state
- np hard
- uncertain data
- communication networks
- communication systems
- regular expressions
- information sharing
- cellular automata
- sample complexity
- information retrieval systems
- finite automata
- fine grained