Richard Lipton
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
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| How to Not Prove Two Important Theorems | The Classification Program of Counting Complexity | 2016-03-28 |
Proposes an approach that amplifies a small-error 3‑edge‑coloring into a full counterexample and proves a reduction showing that an algorithm that colors… | ||
| Karp Plays a Game | KARPfest80 | 2015-10-17 |
Claim: given two engines with one blunder each and the blunders never coincide, a simple randomized procedure lets a nonexpert win a winning chess position… | ||
| nothing matches | ||