Lecture 20: Streaming Part I

I was thinking about the k^th roots-of-unity algorithm for F_k proposed by Jason, Anshu, Aram, and others. As you all convinced me, the expectation works out very nicely. The variance is a bit large: naively it seems to grow like F_2^k instead of F_k^2 and controlling that requires some ideas. Here is a paper by Sumit Ganguly that pursues this direction; maybe you all have ideas of how to do things differently.

The notes for today’s lecture will be only soon.

This entry was posted in Uncategorized. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s