Login / Signup
A Comparison of Two Lower-Bound Methods for Communication Complexity.
Martin Dietzfelbinger
Juraj Hromkovic
Georg Schnitger
Published in:
Theor. Comput. Sci. (1996)
Keyphrases
</>
lower bound
worst case
upper bound
complexity analysis
computational cost
significant improvement
empirical studies
machine learning algorithms
social networks
preprocessing
statistical analysis
high dimensional data
benchmark datasets
qualitative and quantitative
high computational complexity