Comparative complexity of quantum and classical OBDDs for total and partial functions (Q906414): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q62039550, #quickstatements; #temporary_batch_1704758154380 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q62039550 / rank | |||
Normal rank | |||
Revision as of 00:58, 9 January 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
