How hard are n 2 -hard problems? | ACM SIGACT News | DeepDyve