External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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

Wied Pakusa, Svenja Schalthöfer, Erkal Selman. Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time. In Jean-Marc Talbot, Laurent Regnier, editors, 25th EACSL Annual Conference on Computer Science Logic, CSL 2016, August 29 - September 1, 2016, Marseille, France. Volume 62 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]

Authors

Wied Pakusa

This author has not been identified. Look up 'Wied Pakusa' in Google

Svenja Schalthöfer

This author has not been identified. Look up 'Svenja Schalthöfer' in Google

Erkal Selman

This author has not been identified. Look up 'Erkal Selman' in Google
runs on