The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions (Q4419798)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1964145
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8774080276489258
0 references
0.8706731200218201
0 references
0.8652489185333252
0 references
0.8448635339736938
0 references
