Definition courtesy of W|A:

Babai’s latest little gem causing a reasonable stir, as it was to be expected.

*Wikipedia reminds us that in complexity theory, a decision problem is ***NP**–**complete **when it is both in **NP** and **NP**–**hard**. The set of **NP**–**complete** problems is often denoted by **NP**-C or NPC. The abbreviation **NP** refers to “nondeterministic polynomial time”.

### Like this:

Like Loading...

*Related*