NP

Symbol

 * 1)  The class of problems whose solutions can be checked in polynomial time.
 * 1)  The class of problems whose solutions can be checked in polynomial time.
 * 1)  The class of problems whose solutions can be checked in polynomial time.

Noun

 * 1)   the complexity class of computational problems that a nondeterministic Turing machine can solve in polynomial time.
 * 1)   the complexity class of computational problems that a nondeterministic Turing machine can solve in polynomial time.
 * 1)   the complexity class of computational problems that a nondeterministic Turing machine can solve in polynomial time.
 * 1)   the complexity class of computational problems that a nondeterministic Turing machine can solve in polynomial time.
 * 1)   the complexity class of computational problems that a nondeterministic Turing machine can solve in polynomial time.
 * 1)   the complexity class of computational problems that a nondeterministic Turing machine can solve in polynomial time.

Translations

 * French: