A characterization and nearly linear-time equivalence test for \(\mu\)-branching programs (Q679436)
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 1002531
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization and nearly linear-time equivalence test for \(\mu\)-branching programs |
scientific article; zbMATH DE number 1002531 |
Statements
A characterization and nearly linear-time equivalence test for \(\mu\)-branching programs (English)
0 references
7 September 1997
0 references
binary decision diagrams
0 references
\(\mu\)-branching programs
0 references
0.7229992151260376
0 references
0.7109731435775757
0 references
0.7044091820716858
0 references
