Quadratic Maps Are Hard to Sample

DOI10.1145/2934308MaRDI QIDQ4973863zbMATH OpenOpenAlexFDO

Authors Emanuele Viola

Publication date 6 December 2019

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

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

zbMATH Keywords

complexity of distributionsextractorspolynomialssampling

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• scientific article; zbMATH DE number 1583956
• Pathwise properties of random quadratic mapping
• scientific article; zbMATH DE number 431847
• Sampling and the eigenvalues of a quadratic pencil
• Polynomial-time computing over quadratic maps i: sampling in real algebraic sets
• Quasi-random sampling for estimation of integrals of random fields
• Random sampling of large planar maps and convex polyhedra
• Random bit quadrature and approximation of distributions on Hilbert spaces
• Random Low Degree Polynomials are Hard to Approximate
• Almost-uniform sampling of points on high-dimensional algebraic varieties

Cited in

(4)

• Sampling lower bounds: Boolean average-case and permutations
• scientific article; zbMATH DE number 7650118 (Why is no real title available?)
• Sampling, flowers and communication
• Hilbert functions and low-degree randomness extractors

This page was built for publication: Quadratic Maps Are Hard to Sample

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4973863)