Hierarchy:
Description:
{{computing theory}} Describing any problem in the complexity class P to which there exists a polynomial time mapping from any other problem in P.
Ngram:
Ngram Text:
P-complete
Source:
Wiktionary
Issue:
0
Wiktionary tag:
Ngram Count:
1