The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions (Q4419798): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:55, 7 February 2024
scientific article; zbMATH DE number 1964145
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions |
scientific article; zbMATH DE number 1964145 |
Statements
The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions (English)
0 references
16 October 2003
0 references
