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]
@article{DawarRR06,
title = {Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract)},
author = {Anuj Dawar and David Richerby and Benjamin Rossman},
year = {2006},
doi = {10.1016/j.entcs.2005.05.024},
url = {http://dx.doi.org/10.1016/j.entcs.2005.05.024},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/DawarRR06},
cites = {0},
citedby = {0},
journal = {Electronic Notes in Theoretical Computer Science},
volume = {143},
pages = {13-26},
}