The Coin Problem for Product Tests

DOI10.1145/3201787zbMath1427.68220OpenAlexW2808022067WikidataQ129708375 ScholiaQ129708375MaRDI QIDQ4973882

Chin Ho Lee, 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/3201787

zbMATH Keywords

coin problemproduct test

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Other nonclassical models of computation (68Q09) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus$ via the Coin Problem] ⋮ Fourier bounds and pseudorandom generators for product tests

This page was built for publication: The Coin Problem for Product Tests