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 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/12.324559 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1977451125 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:27, 19 March 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
