Feasibility and completeness of cryptographic tasks in the quantum world (Q4910283)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Feasibility and completeness of cryptographic tasks in the quantum world |
scientific article; zbMATH DE number 6145739
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Feasibility and completeness of cryptographic tasks in the quantum world |
scientific article; zbMATH DE number 6145739 |
Statements
Feasibility and Completeness of Cryptographic Tasks in the Quantum World (English)
0 references
18 March 2013
0 references
0.7818934321403503
0 references
0.7719993591308594
0 references
0.7376610040664673
0 references
0.7348652482032776
0 references
