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