Akademik

noun

Abbreviation of "non-deterministic polynomial"; the complexity class of computational problems that a non-deterministic Turing machine can solve in polynomial time.

See Also: NP-complete, NP-hard