{"id":"https://openalex.org/keywords/query-complexity-lower-bounds","display_name":"query complexity lower bounds","description":"Theoretical limits on the number of oracle queries required by algorithms to solve computational problems or distinguish properties.","display_name_alternatives":["oracle query lower bounds","lower bounds for query complexity","lower bounds on query complexity","query complexity lower bound"],"ids":{"openalex":"https://openalex.org/keywords/query-complexity-lower-bounds","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3669,"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.3669,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.2562,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":232,"cited_by_count":4087,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/query-complexity-lower-bounds","updated_date":"2026-11-20T04:06:44","created_date":"2026-09-30T00:00:00"}
