Wied Pakusa, Svenja Schalthöfer, Erkal Selman
Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time
CSL, 2016.
@inproceedings{CSL-2016-PakusaSS,
author = "Wied Pakusa and Svenja Schalthöfer and Erkal Selman",
booktitle = "{Proceedings of the 25th EACSL Annual Conference on Computer Science Logic}",
doi = "10.4230/LIPIcs.CSL.2016.19",
isbn = "978-3-95977-022-4",
pages = "17",
publisher = "{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}",
title = "{Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time}",
year = 2016,
}