Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=1ZLwEiv-lBI


Duration: 21:32
126 views
3

Christoph Berkholz, Humboldt-Universität zu Berlin
https://simons.berkeley.edu/talks/christoph-berkholz-11-08-2016
{Symmetry, Logic, Computation}



Other Videos By Simons Institute for the Theory of Computing


2016-11-10Logic in Computer Science, Engineering and Industry
2016-11-10Functional Programming Over Sets with Atoms
2016-11-10Logic and Bisimulation for Guarded Teams
2016-11-09Braid Groups, Hecke Algebras, Representations, and Anyons
2016-11-09FO-Definable Constraint Satisfaction Problems
2016-11-09Reducts of Finitely Bounded Homogeneous Structures, and...
2016-11-09Power and Limits of LP and SDP Relaxations
2016-11-09Approximating Graph Isomorphism through Linear Maps
2016-11-09Combinatorial Properties of the Weisfeiler-Leman Algorithm
2016-11-09{Symmetry, Logic, Constraint Satisfaction Problem}
2016-11-08Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps
2016-11-08Extending Symmetric Circuits
2016-11-08Graph Isomorphism Via Non-Local Games
2016-11-08A Finite Alternation Result for Reversible Boolean Circuits
2016-11-08One Eilenberg Theorem to Rule Them All
2016-11-08Symmetric Circuits and Fixed-Point Logics
2016-11-08A Dichotomy Structure Theorem for the Resilience Problem
2016-11-08Lower Bounds for Subgraph Isomorphism and Consequences in First-Order Logic
2016-11-07Fibred Categories of Tree Automata
2016-11-07Pro-Aperiodic Monoids via Saturated Models
2016-11-07Operations on Languages and Codensity Monads


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
{Symmetry Logic Computation}
Christoph Berkholz