Derandomization

Here is a post on derandomization. It includes material on the problem of finding a deterministic algorithm for finding primes. It also has a section on the construction of Ramsey graphs. There has recently been an improvement in this area although there is still a gap between constructed graphs and the random graphs.

http://gilkalai.wordpress.com/2009/12/06/four-derandomization-problems/#more-4446

About these ads

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 )

Twitter picture

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

Facebook photo

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

Google+ photo

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

Connecting to %s


Follow

Get every new post delivered to your Inbox.

%d bloggers like this: