Andrei Krokhin
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 |
|---|---|---|
| Classifying the Complexity of SAT and CSP: Are we there yet? | 50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing | 2021-02-11 |
Classifies when finite-domain SAT/CSP are tractable versus NP-complete by pinning complexity to actual algebraic symmetries: polymorphisms control gadget… | ||
| nothing matches | ||