Boolean functions

[531/87%]

Subtopics

Normal forms for Boolean formulas[84/99%]

Complete sets (bases) of Boolean functions[75/100%]

Circuits and binary decision diagrams[66/100%]

Formalizing statements in logic[53/66%]

Counting Boolean functions[34/88%]

Rooted (directed) trees, binary trees, and tree traversals[33/100%]

Burnside's counting theorem[31/71%]

Circuit and branching-program complexity[31/52%]

Horn formulas[31/97%]

Programs with labels (goto/register programs) as a model of computation[30/100%]

Equivalence of propositional formulas[22/68%]

Hadamard matrices[22/50%]

Duality of Boolean functions[8/100%]

Truth tables and formula depth[8/100%]

Realizability of Boolean functions by restricted connectives[7/86%]

Set algebra and propositional logic[7/57%]

Constructing a Boolean formula from a specification[5/80%]

Counting functions on the Boolean cube[5/100%]

Monotone Boolean functions[5/100%]