P-complete

English

Adjective

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

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

(computing theory) The set of such problems.

Related terms

NP-complete

This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.