Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument (Q3525600)
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 5344687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument |
scientific article; zbMATH DE number 5344687 |
Statements
Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument (English)
0 references
17 September 2008
0 references
0.7364863753318787
0 references
0.7333875298500061
0 references
0.7279090285301208
0 references
0.718708336353302
0 references
0.7183446288108826
0 references
