| Document Date: 2014-12-25 20:29:11
Open Document File Size: 85,02 KBShare Result on Facebook
Company SIAM Journal / Dihedral Hidden Subgroup / / IndustryTerm sieving algorithm / modified algorithm / subexponential algorithm / polynomial-time algorithms / subexponential time algorithm / sieve algorithm / subexponential-time quantum algorithm / polynomial time algorithm / quantum algorithm / exponential algorithm / classical algorithms / computing / quantum computing / classical randomized algorithm / quantum algorithms / / Person Dandapani Sivakumar / Phong Q Nguyen / Thomas Vidick / Ravi Kumar / Greg Kuperberg / Peter Høyer / Oded Regev / Mark Ettinger / / Position approximate-SVP / lattice SVP / it does help solve DHSP faster / define SVP / lattice SVP / SVP / representative / / Product Fourier transform / / PublishedMedium SIAM Journal on Computing / / Technology Sieve algorithms / subexponential time algorithm / randomized algorithm / quantum algorithm / classical randomized algorithm / subexponential-time quantum algorithm / quantum algorithms / polynomial time algorithm / known algorithms / sieve algorithm / two presented algorithms / polynomial-time algorithms / modified algorithm / sieving algorithm / subexponential algorithm / exponential algorithm / AKS algorithm / LLL-reduction algorithm / /
SocialTag |
On Quantum Sieve Approaches to the Lattice Shortest Vector Problem Daniel Epelbaum December[removed]