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 the normal view instead:
scientific article; zbMATH DE number 6534152
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9350414276123048
0 references
0.9322412610054016
0 references
0.863627552986145
0 references
0.7851407527923584
0 references
0.7655133605003357
0 references
