P-complete

  1. Adjective.  (computing theory) Describing any problem in the complexity class P to which there exists a polynomial time mapping from any other problem in P.
  2. Proper noun.  (computing theory) The set of such problems.

This is an unmodified, but possibly outdated, definition from Wiktionary and used here under the Creative Commons license. Wiktionary is a great resource. If you like it too, please donate to Wikimedia.

This entry was last updated on RefTopia from its source on 3/20/2012.