Randomly supported independence and resistance

DOI10.1145/1536414.1536481zbMath1304.68134DBLPconf/stoc/AustrinH09OpenAlexW2110225403WikidataQ56958884 ScholiaQ56958884MaRDI QIDQ5172743

Per Austrin, Johan T. Håstad

Publication date: 4 February 2015

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

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

zbMATH Keywords

\(k\)-wise independenceapproximation resistance

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)

This page was built for publication: Randomly supported independence and resistance