Comparative complexity of quantum and classical OBDDs for total and partial functions (Q906414)
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: Comparative complexity of quantum and classical OBDDs for total and partial functions |
scientific article; zbMATH DE number 6534152
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparative complexity of quantum and classical OBDDs for total and partial functions |
scientific article; zbMATH DE number 6534152 |
Statements
Comparative complexity of quantum and classical OBDDs for total and partial functions (English)
0 references
21 January 2016
0 references
ordered binary decision diagrams
0 references
partial functions
0 references
quantum computation
0 references
nondeterminism
0 references
probabilistic OBDDs
0 references
complexity
0 references
0 references
0 references
