I have taken algorithms courses.

This video explains in detail: https://www.youtube.com/watch?v=YX40hbAHx3s

In short, P means Polynomial time (i.e. markets can solve computation problems efficiently) and NP means Non-Deterministic Polynomial time (i.e. markets can verify solutions of computation problems efficiently but solutions are found by luck).

If P != NP, it means luck CANNOT be engineered and markets are competitive.