Blogroll | Communications of the ACM

From Daniel Lemire's Blog

How Database Design Fails Us, and What to do About It

Good database design is crucial to obtain a sound, consistent database, and — in turn — good database design methodologies are the best way to achieve the right... Daniel Lemire
From Daniel Lemire's Blog | October 23, 2011 at 09:32 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

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

You are coordially invited... Why?

When you get an invitation via email should you accept? How well targeted is it? Some real examples that I got. EXAMPLE ONE: I would like to invite you toclick... GASARCH
From Computational Complexity | October 6, 2009 at 05:15 PM

From Computational Complexity

Two Recent Complexity Books omit Mahaney's theorem- ovesight or wisdom?

In a prior post (a while back) I pondered if Mahaney's theorem (SAT \le_m S, S Spare, implies P=NP) should be taught in a basic grad course in complexity. I thought... GASARCH
From Computational Complexity | October 5, 2009 at 05:16 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 Journal Manifesto 2.0

Reminder: FOCS early registration deadline today. Go here Below is a revised version of the Journal Manifesto. I restate the key sentence from my last post and... GASARCH
From Computational Complexity | October 1, 2009 at 05:16 PM

From Computational Complexity

The Journal Manifesto

Some people say that for-profit journals do not currently serve our community well. Some even think they cannot do so. Others think they are doing a fine job as... GASARCH
From Computational Complexity | September 30, 2009 at 05:17 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

Debunking Proofs

One of the comments of the last post asked my (or someones) opinion on the proofs floating around that P=NP or P\ne NP. As a grad student I used to readWhat... GASARCH
From Computational Complexity | September 28, 2009 at 05:18 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

My two cents on P vs NP

There have been several posts on blogs about P vs NP and two expository articles. Is there anything else to add. I'm not sure, but here are my 2 cents. QUESTION... GASARCH
From Computational Complexity | September 24, 2009 at 05:19 PM

From Computational Complexity

Another Reason to goto FOCS: Theory Day!

(Posted by request of Vijay V. Vazirani. Flame him for any spelling or grammar mistakes, or if you don't like the content.) Another reason to goto FOCS:here... GASARCH
From Computational Complexity | September 23, 2009 at 05:20 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

Possibly Recruits for the Polymath Primes Project

In the book The Man who Mistook his Wife for a Hat and other Clinical Tales by Oliver Sacks there is a true story about two twin brothers (John and Michael), both... GASARCH
From Computational Complexity | September 17, 2009 at 05:21 PM

From Computational Complexity

Announcing a New Blog: Silent Glen Speaks

There is another Theory Blogger: Silent Glen. How can a blogger by silent? Sounds like a contradiction in terms! Hope its not a contradiction since she is already... GASARCH
From Computational Complexity | September 16, 2009 at 05:22 PM