{"id":"https://openalex.org/keywords/pls-completeness","display_name":"PLS-completeness","description":"A computational complexity classification describing problems that are as hard as the most difficult problems in polynomial local search.","display_name_alternatives":["PLS-complete","polynomial local search completeness","polynomial local search-complete"],"ids":{"openalex":"https://openalex.org/keywords/pls-completeness","wikidata":null},"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.4237,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.4237,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.372,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":140,"cited_by_count":4880,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/pls-completeness","updated_date":"2026-11-22T04:06:09","created_date":"2026-09-30T00:00:00"}
