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

Proper noun

P-complete

  1. (computing theory) The set of such problems.
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.