11 citations · 25 across the 18 of their papers we have counts for
4 papers · 1 filter
Count-Free Weisfeiler--Leman and Group Isomorphism
Nathaniel A. Collins, Michael Levet
We investigate the power of counting in Group Isomorphism. We first leverage the count-free variant of the Weisfeiler--Leman Version I algorithm for groups (Brachter & Schweitzer,…
On the Descriptive Complexity of Groups without Abelian Normal Subgroups
Joshua A. Grochow, Michael Levet
In this paper, we explore the descriptive complexity theory of finite groups by examining the power of the second Ehrenfeucht--Fraïssé bijective pebble game in Hella's (Ann. Pure A…
On the Complexity of Identifying Strongly Regular Graphs
Michael Levet
In this paper, we show that Graph Isomorphism (GI) is not -reducible to several problems, including the Latin Square Isotopy problem, isomorphism testing of severa…
Experience Report: Standards-Based Grading at Scale in Algorithms
Lijun Chen, Joshua A. Grochow, Ryan Layer +1
We report our experiences implementing standards-based grading at scale in an Algorithms course, which serves as the terminal required CS Theory course in our department's undergra…