Characterising Choiceless Polynomial Time with First-Order Interpretations

DOI10.1109/LICS.2015.68zbMath1394.68161MaRDI QIDQ4635846

Łukasz Kaiser, Erich Grädel, Wied Pakusa, Svenja Schalthöfer

Publication date: 23 April 2018

Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19)

Related Items (2)

Is Polynomial Time Choiceless? ⋮ Choiceless Logarithmic Space

This page was built for publication: Characterising Choiceless Polynomial Time with First-Order Interpretations