Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract)

Anuj Dawar, David Richerby, Benjamin Rossman. Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract). Electronic Notes in Theoretical Computer Science, 143:13-26, 2006. [doi]

Abstract

Abstract is missing.