1. P-complete - Adjective
2. P-complete - Proper noun
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.
P-complete
(computing theory) The set of such problems.
Develops the theory, then catalogs 96 P-Complete problems. Source: Internet
In order to prove that a given problem in P is P-complete, one typically tries to reduce a known P-complete problem to the given one. Source: Internet
It is clear that this problem is P-complete: if we can parallelize a general simulation of a sequential computer, then we will be able to parallelize any program that runs on that computer. Source: Internet
It occurs in some decision problem descriptions in theoretical computer science (e.g. some P-complete problems), where it is used to "artificially" decrease the run-time or space requirements of a problem. Source: Internet
Many other problems have been proved to be P-complete, and therefore are widely believed to be inherently sequential. Source: Internet
Similarly there are problems in P that are not known to be either P-complete or NC, but are thought to be difficult to parallelize. Source: Internet