Bart Selman
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 |
|---|---|---|
| Automated Scientific Discovery Using Insights from Problem Structure | Learning, Algorithm Design and Beyond Worst-Case Analysis | 2016-11-14 |
Shows how a plain SAT solver plus unit propagation and clause learning finds a machine proof of the Erdős discrepancy case (the 1161 bound and a 1160 witness)… | ||
| Fourier Representations in Probabilistic Inference | Uncertainty in Computation 2016 | 2016-10-04 |
Claim: Boolean probability tables for bounded‑width factor graphs have most L2 mass on low‑degree Hadamard/Fourier basis coefficients, so truncating high‑order… | ||
| nothing matches | ||