| 2004 | ||
|---|---|---|
| j3 | Mark Ettinger, Peter Høyer, Emanuel Knill: The quantum query complexity of the hidden subgroup problem is polynomial. Inf. Process. Lett. 91(1): 43-48 (2004) | |
| 2002 | ||
| j2 | ||
| 2000 | ||
| j1 | ||
| 1999 | ||
| c2 | Mark Ettinger, Peter Høyer: On Quantum Algorithms for Noncommutative Hidden Subgroups. STACS 1999: 478-487 | |
| 1998 | ||
| c1 | ||
| 1 | Peter Høyer | |
| 2 | Emanuel Knill |
Data released under the ODC-BY 1.0 license — See also our legal information page