Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time

Saarbrücken/Wadern / Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing (2016) [Contribution to a book, Contribution to a conference proceedings]

Computer science logic 2016 : CSL 2016, August 29 to September 1, 2016, Marseille, France / edited by Laurent Regnier, Jean-Marc Talbot

Authors

Selected Authors

Pakusa, Wied
Schalthöfer, Svenja
Selman, Aziz Erkal

Identifier