~/talk

Symmetric Circuits and Fixed-Point Logics

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

Characterizes exactly which graph properties symmetric circuits capture: polynomial-size symmetric circuits without majority correspond to fixed-point logic interpreted over the structure plus a separate ordered number sort, and polynomial-size symmetric majority circuits exactly capture fixed-point with counting (FPC). Proof sketch: convert formulas to uniform symmetric circuits by instantiating gates for subformulas, and conversely recover evaluation in FPC by labeling gates with small constant supports so only permutations of those supports matter, using p‑uniformity on the number sort. Consequences: parity and CFI-style obstructions separate these classes.

AI-written summary · about

  1. 0:00Introduction
  2. 3:38FixedPoint Logic
  3. 5:04Ordering Operator
  4. 6:39Non trivial results
  5. 8:07Nonuniform circuits
  6. 10:20Lower bounds
  7. 11:13Monotone circuits
  8. 12:17Properties of graphs
  9. 14:02Syntax
  10. 17:43Results
  11. 20:14Questions
  12. 21:16Main Results
  13. 23:20Prior Work
  14. 24:55Main Theorem
  15. 27:32Choiceless polynomial time
  16. 28:54Boolean circuits
  17. 32:13Polynomial time
~/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.