The Space Complexity of Approximating th
✍
Noga Alon; Yossi Matias; Mario Szegedy
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 172 KB
The frequency moments of a sequence containing m i elements of type i, 1 i n, are the numbers F k = n i=1 m k i . We consider the space complexity of randomized algorithms that approximate the numbers F k , when the elements of the sequence are given one by one and cannot be stored. Surprisingly, it