Eric Allender
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
- Harsha Tirumalaonce
- Shuichi Hiraharaonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Kolmogorov Complexity Characterizes Statistical Zero Knowledge | ITCS 2023 | 2023-01-10 |
Main theorem: for any reasonable promise problem A, A in NISZK iff A RP many-one reduces to RK (with RK using approximation error e(m) ≈ Θ(log^2 m)), and A in… | ||
| Graph Automorphism and Circuit Size | Connections Between Algorithm Design and Complexity Theory | 2015-09-28 |
Shows Graph Automorphism in ZPP relative to the KT/ MKT oracle by reducing rigid-instance isomorphism to a KT-complexity gap: encode T random permutations into… | ||
| nothing matches | ||