P-complete

English

Adjective

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

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

P-complete

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

Related terms

• NP-complete