Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams (Q1293553)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams |
scientific article; zbMATH DE number 1309897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams |
scientific article; zbMATH DE number 1309897 |
Statements
Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams (English)
0 references
28 June 1999
0 references
ordered binary decision diagrams
0 references
0.88189995
0 references
0 references
0 references
0.86704886
0 references
0.86695564
0 references
0.86396676
0 references
0.86396676
0 references
0.86265373
0 references
