(Why I keep using the term “P-Law”) P-complete – Wikipedia In computational comp

(Why I keep using the term “P-Law”)
P-complete – Wikipedia
In computational complexity theory, a decision problem is P-complete (complete for the complexity class P) if it is in P and every problem in P can be reduced to it by an appropriate reduction.
https://en.wikipedia.org/wiki/P-complete