Comparative complexity of quantum and classical OBDDs for total and partial functions (Q906414): Difference between revisions
From MaRDI portal
Latest revision as of 08:19, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Comparative complexity of quantum and classical OBDDs for total and partial functions |
scientific article |
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