P-complete
Jump to navigation
Jump to search
English[edit]
Adjective[edit]
P-complete (not comparable)
- (computing theory) Describing any problem in the complexity class P to which there exists a polynomial time mapping from any other problem in P.
Translations[edit]
describing any problem in P to which there exists a polynomial time mapping from any other problem in P
|