PLS-completeness
Description: A computational complexity classification describing problems that are as hard as the most difficult problems in polynomial local search.
Primary topic: Game Theory and Applications (42%)
OpenAlex ID: keywords/pls-completeness
