Srikanth Srinivasan
where else to find them
no profile links on file
what they talk about
their talks carry no tags yet
where they keep going back
no series more than once — all 2 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| The Coin Problem and AC^0[parity] | Boolean Devices 2018 | 2018-09-10 |
Proves that the delta coin problem can be solved by explicit depth‑3 AC0[⊕] formulas using only poly(1/δ) samples (instead of exponentially many), yielding a… | ||
| A Compression Algorithm for AC^0[p] Circuits Using Certifying Polynomials | Connections Between Algorithm Design and Complexity Theory | 2015-09-28 |
Algorithm compresses Boolean truth tables that have small AC^0[p] circuits into circuits of size about 2^n / m where m = exp(Ω(n / polylog n)) for constant… | ||
| nothing matches | ||