UC Berkeley's Jason Lee questions research consensus on the tight 2^n complexity bound of a computational problem · Digg