{"id":"https://openalex.org/keywords/boolean-function-complexity","display_name":"Boolean function complexity","description":"A measure or study of the resources, such as circuit size or computation time, required to represent or compute Boolean functions.","display_name_alternatives":["complexity of a Boolean function","complexity of Boolean functions"],"ids":{"openalex":"https://openalex.org/keywords/boolean-function-complexity","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5334,"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.5334,"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/T11130","display_name":"Coding theory and cryptography","score":0.0713,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":209,"cited_by_count":3027,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/boolean-function-complexity","updated_date":"2026-11-17T04:05:58","created_date":"2026-09-30T00:00:00"}
