🇬🇧 en fi 🇫🇮

P-complete 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.
 P-täydellinen
Wiktionary Links