5 citations · 6 across the 6 of their papers we have counts for
1 paper · 1 filter
Martin Grohe, Oleg Verbitsky
Our starting point is the observation that if graphs in a class C have low descriptive complexity in first order logic, then the isomorphism problem for C is solvable by a fast par…