{"id":"https://openalex.org/keywords/p-selective-sets","display_name":"P-selective sets","description":"Complexity-theoretic sets for which membership can be decided by a polynomial-time algorithm making a bounded number of adaptive queries to the set.","display_name_alternatives":["P-selective set","polynomial-time selective sets","polynomial-time selective set","P-selectivity"],"ids":{"openalex":"https://openalex.org/keywords/p-selective-sets","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5218,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5218,"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"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.3977,"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":99,"cited_by_count":1390,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/p-selective-sets","updated_date":"2026-11-20T04:06:44","created_date":"2026-09-30T00:00:00"}
