SAT for instance has only been solved with O(2^n) algorithms so far. The tricky thing here is that we don't quite know whether it could be done any quicker (google up P=NP for a more detailed description).