# NP-complete

> English word · Adjective

## Definitions
1. That is both NP (solvable in polynomial time by a non-deterministic Turing machine) and NP-hard (such that any (other) NP problem can be reduced to it in polynomial time).

## Source
Compiled from Wiktionary via kaikki.org (CC BY-SA). Data vintage: 2026-05-06.
Canonical page: https://plainspell.com/en/word/np-complete