![](/img/cover-not-exists.png)
Choiceless Polynomial Time, Counting and the Cai–Fürer–Immerman Graphs: (Extended Abstract)
Anuj Dawar, David Richerby, Benjamin RossmanVolume:
143
Year:
2006
Language:
english
Pages:
14
DOI:
10.1016/j.entcs.2005.05.024
File:
PDF, 287 KB
english, 2006