
Limitations of the InvertibleMap Equivalences
This note draws conclusions that arise by combining two recent papers, b...
read it

Lower Bounds for Symmetric Circuits for the Determinant
Dawar and Wilsenach (ICALP 2020) introduce the model of symmetric arithm...
read it

Separating LREC from LFP
LREC= is an extension of firstorder logic with a logarithmic recursion ...
read it

LovászType Theorems and Game Comonads
Lovász (1967) showed that two finite relational structures A and B are i...
read it

On the relative power of algebraic approximations of graph isomorphism
We compare the capabilities of two approaches to approximating graph iso...
read it

MSO Undecidability for some Hereditary Classes of Unbounded CliqueWidth
Seese's conjecture for finite graphs states that monadic secondorder lo...
read it

Extension Preservation in the Finite and Prefix Classes of First Order Logic
It is well known that the classic ŁośTarski preservation theorem fails ...
read it

Game Comonads Generalised Quantifiers
Game comonads, introduced by Abramsky, Dawar and Wang and developed by A...
read it

Symmetric Arithmetic Circuits
We introduce symmetric arithmetic circuits, i.e. arithmetic circuits wit...
read it

Relativization of Gurevich's Conjectures
Gurevich (1988) conjectured that there is no logic for P or for NP∩coNP....
read it

Generalizations of kWeisfeilerLeman partitions and related graph invariants
The family of WeisfeilerLeman equivalences on graphs is a widely studie...
read it

Approximations of Isomorphism and Logics with LinearAlgebraic Operators
Invertible map equivalences are approximations of graph isomorphism that...
read it

On the Power of Symmetric Linear Programs
We consider families of symmetric linear programs (LPs) that decide a pr...
read it

Constructing Hard Examples for Graph Isomorphism
We describe a method for generating graphs that provide difficult exampl...
read it

Definable Inapproximability: New Challenges for Duplicator
We consider the hardness of approximation of optimization problems from ...
read it

Symmetric Circuits for Rank Logic
Fixedpoint logic with rank (FPR) is an extension of fixedpoint logic w...
read it
Anuj Dawar
is this you? claim profile