Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time
New York, NY / Association for Computing Machinery (2018) [Journal Article]
ACM transactions on computational logic : TOCL
Volume: 19
Issue: 2
Page(s): 7
Authors
Selected Authors
Pakusa, Wied
Schalthöfer, Svenja
Selman, Aziz Erkal
Identifier
- DOI: 10.1145/3154456
- REPORT NUMBER: RWTH-2018-227067