~/talk

Reducts of Finitely Bounded Homogeneous Structures, and...

Talkat Symmetry, Logic, Computation 2016 · 2016-11-07..11-10
links:none on file
slides:none on file

Claims a conditional P versus NP-complete dichotomy for reducts of finitely bounded homogeneous structures assuming the finite-domain tractability conjecture, and gives a decidable criterion when polymorphism clones admit canonical functions and mseudocyclic polymorphisms. Tools are oligomorphic automorphism groups, the topology of pointwise convergence on clones, continuous clone homomorphisms to the projection clone, and the combinatorial notion of mashups. Shows canonical witnesses yield tractability or NP-hardness in many cases but notes the rational-order reducts (Q) resist the canonical-only method.

AI-written summary · about

  1. 0:00Intro
  2. 0:52What is this about?
  3. 2:16Outline
  4. 3:19Constraint Satisfaction Problems
  5. 6:16The Finite-Domain Conjecture
  6. 8:39Finitely Bounded Homogeneous Structures
  7. 11:27The Bodirsky.Pinsker Conjecture
  8. 16:37Oligomorphic groups, clones
  9. 23:16Algebraic Dichotomy
  10. 26:41Where are canonical functions enough?
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.