Blogroll | Communications of the ACM

From Computational Complexity

FOCS Last Day

Last (but surely not least) day at FOCS 09!Jan Vondrak talked about some nice results that unify previous query complexity approaches in proving lower bounds for... Lance
From Computational Complexity | October 28, 2009 at 11:06 AM

From Computational Complexity

FOCS Day 2

After an early morning injection of much needed caffeine, Team Northwestern was ready for the next round of talks. Today's program consisted of talks more related... Lance
From Computational Complexity | October 27, 2009 at 10:26 AM

From Computational Complexity

FOCS Day 1

Michele and Michael continue their guest posts from Atlanta.The first day of FOCS is officially over. 8 sessions, 26 talks and 270 proceedings pages have already... Lance
From Computational Complexity | October 26, 2009 at 10:20 AM

From Computational Complexity

FOCS Day 0

Alas, I'm not in Atlanta but in New York City for another meeting. Something different this time--FOCS through the eyes of two Northwestern students, Michele Budinich and... Lance
From Computational Complexity | October 25, 2009 at 10:39 PM

From Computational Complexity

The Humbling Power of P v NP

[Note from Bill: He now has an on-line list of papers who still need reviewers] Noam Nisan, back in grad school in the 80's made the following suggestion... Lance
From Computational Complexity | October 21, 2009 at 10:57 AM

From Computational Complexity

Typecasting Again

Lance: Welcome to our second typecast on the last full day of Dagstuhl. I may not see Bill for a while so we'd thought we'd get in one more chat before we go our... Lance Fortnow
From Computational Complexity | October 16, 2009 at 09:41 AM

From Computational Complexity

Thanks for the Fuzzy Memories

In the 1990's Manindra Agrawal and V. Arvind published a paper claiming that if SAT is reducible to a (non-uniform) weighted threshold function then P = NP. Their... Lance
From Computational Complexity | October 15, 2009 at 04:59 PM

From Computational Complexity

Bill and Lance's Excellent German Adventure

Lance: Because we don't have a good microphone, Bill and I decided to have our first typecast. Hi Bill. Bill: Hi Lance. We'll be typecast SUPERSTARS. ... Lance
From Computational Complexity | October 14, 2009 at 05:12 PM

From Computational Complexity

Dagstuhl Day One

The talks Monday were after my own heart. The day started with relativization: The always entertaining Scott Aaronson talked on his approach to get an oracle where... Lance
From Computational Complexity | October 13, 2009 at 11:34 AM

From Computational Complexity

The Molly Solution

This week Bill and I are both at the Dagstuhl Workshop on Algebraic Methods in Computation Complexity. I'll try to cover some of the talks and discussions on the... Lance
From Computational Complexity | October 12, 2009 at 05:12 PM

From Computational Complexity

Complexity Vidcast 2

Bill and I battle it out over what should be taught in a complexity course in our new vidcast. Lance
From Computational Complexity | October 9, 2009 at 05:14 PM

From Computational Complexity

Publicity for P versus NP

On the New York Times website, John Markoff writes an article Prizes Aside, the P-NP Puzzler has Consequences motivated by my CACM article on The Status of the.... Lance
From Computational Complexity | October 8, 2009 at 05:14 PM

From Computational Complexity

On Being Narrow

In a tweet a few days ago, David Bacon wonders why everyone always assumes all he can do is quantum computing? Oh, because that's all he's done. Time to do something... Lance
From Computational Complexity | October 2, 2009 at 05:16 PM

From Computational Complexity

The IT Rules

My family has discovered a British Series, the IT Crowd, about two techies in a corporate IT department. An American version never got past the pilot phase. ... Lance
From Computational Complexity | September 29, 2009 at 05:17 PM

From Computational Complexity

Inspiring a Love of Math

A reader writes I come to you by way of your computational complexity blog. I get that there is some really good stuff there, but frankly don’t understand about... Lance
From Computational Complexity | September 25, 2009 at 05:19 PM

From Computational Complexity

The Netflix Prize and the Sequel

Nearly three years ago I posted on the just announced Netflix prize. First to a 10% increase in the quality of the movie recommendations would receive a million... Lance
From Computational Complexity | September 22, 2009 at 05:18 PM

From Computational Complexity

Why You Shouldn't Not Go to FOCS

You can now register on-line for FOCS which includes the 50th celebration. Early registration deadline is October 1. Hotel rate good until October 9th or whilehttp... Lance
From Computational Complexity | September 21, 2009 at 05:20 PM

From Computational Complexity

You Will All Work for Google

Google has acquired reCAPTCHA, Luis von Ahn's project to use humans to aid transcribing old documents. We consider Luis an honorary theorist and congrats for the... Lance
From Computational Complexity | September 18, 2009 at 05:21 PM

From Computational Complexity

Fashionable Research

A student asks "How do you survive in the academic world if what you want to do is not fashionable?" You shouldn't necessarily focus your research on the currently... Lance
From Computational Complexity | September 15, 2009 at 05:22 PM

From Computational Complexity

The Mystique of the Open Problem

The story goes that Andrew Wiles dreamt of proving Fermat's last theorem when he was a kid. No surprise since all of us math-loving kids dreamed of solving this... Lance
From Computational Complexity | September 11, 2009 at 05:23 PM