10 citations · 12 across the 5 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2018
Constructing Hard Examples for Graph Isomorphism
Anuj Dawar, Kashif Khan
We describe a method for generating graphs that provide difficult examples for practical Graph Isomorphism testers. We first give the theoretical construction, showing that we can…
cs.CC2018
Symmetric Circuits for Rank Logic
Anuj Dawar, Gregory Wilsenach
Fixed-point logic with rank (FPR) is an extension of fixed-point logic with counting (FPC) with operators for computing the rank of a matrix over a finite field. The expressive pow…