Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument (Q3525600)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument |
scientific article |
Statements
Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument (English)
0 references
17 September 2008
0 references