Where the really hard problems are

It is well known that for many NPcomplete problems, such as K-Sat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard problems occur at a critical value of such a parameter.