First of all we give some reasons that “natural proofs” built not a barrier to prove P not= NP using Boolean complexity. Then we investigate the approximation method for its extension to prove super-polynomial lower bounds for the non-monotone complexity of suitable Boolean functions in NP or to understand why ... more >>>