Explore relationships

PLS (complexity)

In computational complexity theory, Polynomial Local Search (PLS) is a complexity class that models the difficulty of finding a locally optimal solution to an optimization problem.

Use + to expand a branch. Click a topic name to open its summary.