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]

Authors

Anuj Dawar

This author has not been identified. Look up 'Anuj Dawar' in Google

David Richerby

This author has not been identified. Look up 'David Richerby' in Google

Benjamin Rossman

This author has not been identified. Look up 'Benjamin Rossman' in Google