Almost Optimal Pseudorandom Generators for Spherical Caps

DOI10.1145/2746539.2746611zbMath1321.65008OpenAlexW2004507500MaRDI QIDQ2941513

Raghu Meka, Pravesh K. Kothari

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2746539.2746611

zbMATH Keywords

orthogonal designspseudorandom generatorsclassical moment problemhalfspaces

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Random number generation in numerical analysis (65C10)

Related Items

Fooling Polytopes ⋮ Pseudorandomness via the Discrete Fourier Transform ⋮ Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time ⋮ Simple and efficient pseudorandom generators from gaussian processes

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming