Srinivasan Arunachalam
where else to find them
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
- Aarthi Sundaramonce
- Alex B. Griloonce
- Igor C. Oliveiraonce
all 5 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Quantum Learning Algorithms Imply Circuit Lower Bounds | Lower Bounds, Learning, and Average-Case Complexity | 2023-02-13 |
Shows a concrete implication: any quantum learner that beats the two trivial learners (full truth-table queries or the sampling-based 1/2 − 2^{-n/2} advantage)… | ||
| Communication memento: Memoryless communication complexity | ITCS 2021 | 2021-01-06 |
Defines memoryless communication complexity where messages are a rewritable register and cost is the largest message size, proves tight equivalences with… | ||
| nothing matches | ||