Quantum computers that can be simulated classically in polynomial time (Q5175959): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A constant-factor approximation algorithm for the <i>k</i> -median problem (extended abstract) / rank | |||
Normal rank | |||
Latest revision as of 19:04, 9 July 2024
scientific article; zbMATH DE number 6409703
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quantum computers that can be simulated classically in polynomial time |
scientific article; zbMATH DE number 6409703 |
Statements
Quantum computers that can be simulated classically in polynomial time (English)
0 references
27 February 2015
0 references
