research
∙
08/10/2023
Limitations of Game Comonads via Homomorphism Indistinguishability
Abramsky, Dawar, and Wang (2017) introduced the pebbling comonad for k-v...
share
research
∙
02/08/2023
Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits
Choiceless Polynomial Time (CPT) is one of the few remaining candidate l...
research
∙
06/10/2022
Finite Model Theory and Proof Complexity revisited: Distinguishing graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus
This paper extends prior work on the connections between logics from fin...
research
∙
07/08/2021
Choiceless Polynomial Time, Symmetric Circuits and Cai-Fürer-Immerman Graphs
Choiceless Polynomial Time (CPT) is currently the only candidate logic f...
research
∙
02/26/2018