Andrew Drucker
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 1 in the filters
on a stage with
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Limits to Efficient Preprocessing | Information Theory in Complexity Theory and Combinatorics 2015 | 2015-04-24 |
Shows that OR-SAT and AND-SAT do not admit polynomial kernels unless NP ⊆ coNP/poly, and extends the impossibility to randomized and a defined quantum… | ||
| nothing matches | ||