P-complete

Definition from Wiktionary, the free dictionary
Jump to: navigation, search

English[edit]

Adjective[edit]

P-complete (not comparable)

  1. (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]

Proper noun[edit]

P-complete

  1. (computing theory) The set of such problems.