Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams (Q1293553): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s002240000128 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1998134727 / rank | |||
Normal rank | |||
Revision as of 00:56, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams |
scientific article |
Statements
Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams (English)
0 references
28 June 1999
0 references
ordered binary decision diagrams
0 references
