Pseudorandomness for read-k DNF formulas
From MaRDI portal
Publication:5236220
DOI10.1137/1.9781611975482.39zbMath1431.68142OpenAlexW3174787505MaRDI QIDQ5236220
Li-Yang Tan, Rocco A. Servedio
Publication date: 15 October 2019
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611975482.39
Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (2)
Paradigms for Unconditional Pseudorandom Generators ⋮ Near-optimal pseudorandom generators for constant-depth read-once formulas
This page was built for publication: Pseudorandomness for read-k DNF formulas
