Collaborated with:
W.Pakusa E.Selman
Talks about:
choiceless (1) polynomi (1) immerman (1) problem (1) fürer (1) defin (1) time (1) cai (1)
Person: Svenja Schalthöfer
DBLP: Schalth=ouml=fer:Svenja
Contributed to:
Wrote 1 papers:
- CSL-2016-PakusaSS #polynomial #problem
- Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time (WP, SS, ES), p. 17.