411 REFERENCE · Wiktionary
P-complete
Reference material by Wiktionary contributors. This retains its source identity and is not 411 news reporting.
English
Adjective
P-complete -
en 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
describing any problem in P to which there exists a polynomial time mapping from any other problem in P
Finnish: fi P-täydellinen
German: de P-vollständig
Proper noun
P-complete
en computing theory The set of such problems.
Related terms
en NP-complete