Hakuluettelo:
Käännös:
NP-complete (suomeksi)
- Määritelmät:
- (lb, en, computing theory) Describing the hardest problems that are in the class NP, and whose solutions can be verified in polynomial time.
Viimeisimmät haut: NP-complete, stereospecificities, roller shutters, chief constable, avomeren, no doubt