Login / Signup
Lower Bounds for One-Way Probabilistic Communication Complexity and Their Application to Space Complexity.
Farid M. Ablayev
Published in:
Theor. Comput. Sci. (1996)
Keyphrases
</>
space complexity
lower bound
worst case
arc consistency
bayesian networks
objective function
upper bound
worst case time complexity
neural network
search algorithm
online learning
generative model
decision problems
vc dimension
average case complexity