Problemintro
Boolean function composition
Also called functional composition.
Given BDDs for functions, build the BDD of an expression that combines or substitutes them.
Given BDDs for functions, build the BDD of an expression that combines or substitutes them.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag TY2RZS Edit this page History Report an error