P-complete

From Wiktionary, the free dictionary

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

Finnish: P-täydellinen
German: P-vollständig

Proper noun[edit]

P -complete

(computing theory) The set of such problems.

Related terms[edit]

NP-complete

Retrieved from "https://en.wiktionary.org/w/index.php?title=P-complete&oldid=70921211"