Choiceless polynomial time, counting and the Cai–Fürer–Immerman graphs (Extended Abstract) (2007)

by Anuj Dawar , David Richerby , Benjamin Rossman
Venue:IN: PROC. 12TH WORKSHOP ON LOGIC, LANGUAGE, INFORMATION AND COMPUTATION
Citations:8 - 3 self