I've been looking for a reference for the above question. As far as I know the answer is:If we can make a solver that is efficient for all randomly generated instances, it should be efficient for any instance.i.e. if we make a solver that doesnt rely on any inherent structure, it will always be efficient.Is this correct? Either way, does anyone have a reference to a paper I can cite for the answer. 
Why do we care about random Boolean SAT formula?
satisfiability;randomness