scientific article; zbMATH DE number 7378736
From MaRDI portal
Publication:5009633
DOI10.4230/LIPIcs.ESA.2018.66MaRDI QIDQ5009633
Miklos Santha, Anupam Prakash, Gábor Ivanyos
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1806.09660
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Quantum algorithms for variants of average-case lattice problems via filtering ⋮ Quantum learning Boolean linear functions w.r.t. product distributions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Public-key cryptosystems from the worst-case shortest vector problem
- Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- On lattices, learning with errors, random linear codes, and cryptography
- The expected number of random elements to generate a finite Abelian group
