The Coin Problem for Product Tests
From MaRDI portal
Publication:4973882
DOI10.1145/3201787zbMath1427.68220MaRDI QIDQ4973882
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/3201787
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q09: Other nonclassical models of computation
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus$ via the Coin Problem], Fourier bounds and pseudorandom generators for product tests