P-complete en · ADJ
Meanings
- (not-comparable) Describing any problem in the complexity class P to which there exists a polynomial time mapping from any other problem in P.
Translations (2)
fi P-täydellinen (describing any problem in P to which there exists a polynomial time mapping from any other problem in P) · de P-vollständig (describing any problem in P to which there exists a polynomial time mapping from any other problem in P)