Abstract
This talk will focus on some of Immerman's view and current work on the search for a language capturing order-independent polynomial-time, and its relation to the complexity of graph isomorphism and canonization.
This talk will focus on some of Immerman's view and current work on the search for a language capturing order-independent polynomial-time, and its relation to the complexity of graph isomorphism and canonization.