Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time
From MaRDI portal
Publication:5278405
DOI10.4230/LIPIcs.CSL.2016.19zbMath1369.68222OpenAlexW2552847231MaRDI QIDQ5278405
Svenja Schalthöfer, Erkal Selman, Wied Pakusa
Publication date: 19 July 2017
Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.CSL.2016.19
finite model theorydescriptive complexitychoiceless polynomial timeCai-Fürer-Immermanlogic for PTime
Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)
Related Items (1)
This page was built for publication: Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time