Nonuniformity is a central concept in computational complexity with powerful connections to circuit and randomness. Nonuniform reductions have been used study the isomorphism conjecture for NP completeness larger classes. We power of nonuniform NP-completeness, obtaining both separations upper bounds vs uniform complessness NP. Under various hypotheses, we obtain following separations: also con...