A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space Oded Regev

@inproceedings{Regev1994AST,
  title={A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space Oded Regev},
  author={Oded Regev},
  year={1994}
}
In a recent paper, Kuperberg described the first subexponential time algorithm for solving the dihedral hidden subgroup problem. The space requirement of his algorithm is superpolynomial. We describe a modified algorithm whose running time is still subexponential and whose space requirement is only polynomial.