1 paper
Aaron Snook, Grant Schoenebeck, Paolo Codenotti
In this paper we show lower bounds for a certain large class of algorithms solving the Graph Isomorphism problem, even on expander graph instances. Spielman [25] shows an algorithm…