NP

English

((computing theory{{#if:|, {{{2}}}{{#if:|, {{{3}}}{{#if:|, {{{4}}}{{#if:|, {{{5}}}{{#if:|, {{{6}}}{{#if:|, {{{7}}}{{#if:|, {{{8}}}{{#if:|, {{{9}}}}}}}}}}}}}}}}}}})) Abbreviation of Non-deterministic Polynomial. The complexity class of computational problems that a non-deterministic Turing machine can solve in polynomial time.