@InProceedings{pakusa_et_al:LIPIcs.CSL.2016.19,
  author =	{Pakusa, Wied and Schalth\"{o}fer, Svenja and Selman, Erkal},
  title =	{{Definability of Cai-F\"{u}rer-Immerman Problems in Choiceless Polynomial Time}},
  booktitle =	{25th EACSL Annual Conference on Computer Science Logic (CSL 2016)},
  pages =	{19:1--19:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-022-4},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{62},
  editor =	{Talbot, Jean-Marc and Regnier, Laurent},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.19},
  URN =		{urn:nbn:de:0030-drops-65595},
  doi =		{10.4230/LIPIcs.CSL.2016.19},
  annote =	{Keywords: finite model theory, descriptive complexity, logic for textsc\{Ptime\}, Choiceless Polynomial Time, Cai-F\"{u}rer-Immerman}
}