non-deterministic polynomial time

The greatest unsolved problem in computer science...

Fireship

The class of problems (NP) where solutions can be verified quickly, but finding the solution might take an infeasibly long time.