Finer-grained hardness of kernel density estimation
From MaRDI portal
Cites work
- A fast algorithm for particle simulations
- A quasi-Monte Carlo data structure for smooth kernel evaluations
- Algorithms and hardness for linear algebra on geometric graphs
- Efficient density evaluation for smooth kernels
- Hardness of approximate nearest neighbor search
- Hashing-based-estimators for kernel density in high dimensions
- Kernel Mean Embedding of Distributions: A Review and Beyond
- Kernel density estimation through density constrained near neighbor search
- Multi-resolution hashing for fast pairwise summations
- Near-optimal coresets of kernel density estimates
- Normal subgroup reconstruction and quantum computation using group representations
- On the difference between closest, furthest, and orthogonal pairs: nearly-linear vs barely-subquadratic complexity
- On the hardness of approximate and exact (bichromatic) maximum inner product
- Optimal-degree polynomial approximations for exponentials and Gaussian kernel density estimation
- Probabilistic polynomials and Hamming nearest neighbors
- Quantum spectrum testing
- Rectangular Kronecker coefficients and plethysms in geometric complexity theory
- The Fast Gauss Transform
This page was built for publication: Finer-grained hardness of kernel density estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866457)
