|
|
Definition of 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. ¹
¹ Source: wiktionary.com
Lexicographical Neighbors of P-complete
Other Resources:
