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.
Primary topic: Complexity and Algorithms in Graphs (53%)
OpenAlex ID: keywords/boolean-function-complexity
