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

Pakusa, Wied (Corresponding author); Schalthöfer, Svenja (Corresponding author); Selman, Aziz Erkal (Corresponding author)

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

In: Computer science logic 2016 : CSL 2016, August 29 to September 1, 2016, Marseille, France / edited by Laurent Regnier, Jean-Marc Talbot
Page(s)/Article-Nr.: 19:1-19:17

Institutions

  • Mathematical Fundamentals of Computer Science (Logic and Complexity) Teaching and Research Area [117220]
  • Department of Mathematics [110000]
  • Chair of Computer Science 7 (Logic and Theory of Discrete Systems) [122910]
  • Department of Computer Science [120000]