<Complexity> (P) The set or property of problems whiCh Can be solved by a known polynomial-time algorithm. (1995-04-10)

In addition suitable Contents:
[ = ] [ al ] [ algorithm ] [ am ] [ an ] [ ar ] [ arC ] [ b ] [ be ] [ by ] [ Ca ] [ Ch ] [ Co ] [ Com ] [ Complexity ] [ du ] [ ed ] [ er ] [ et ] [ fi ] [ file ] [ h ] [ hm ] [ hr ] [ id ] [ il ] [ it ] [ kn ] [ Lex ] [ lv ] [ ly ] [ mo ] [ mod ] [ module ] [ mp ] [ ms ] [ na ] [ no ] [ om ] [ op ] [ pe ] [ ph ] [ pl ] [ polynomial ] [ polynomial-time algorithm ] [ pr ] [ query ] [ rC ] [ re ] [ ro ] [ se ] [ set ] [ so ] [ T ] [ th ] [ ve ]