• P-complete

P-complete (suomeksi)

Määritelmät:

• (lb, en, computing theory) Describing any problem in the complexity class P to which there exists a polynomial time mapping from any other problem in P.
• (lb, en, computing theory) The set of such problems.