5 citations · 10 across the 6 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.LO2023
Limitations of Game Comonads via Homomorphism Indistinguishability
Moritz Lichter, Benedikt Pago, Tim Seppelt
Abramsky, Dawar, and Wang (2017) introduced the pebbling comonad for k-variable counting logic and thereby initiated a line of work that imports category theoretic machinery to fin…
cs.CC2023
Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits
Benedikt Pago
Choiceless Polynomial Time (CPT) is one of the few remaining candidate logics for capturing PTIME. In this paper, we make progress towards separating CPT from polynomial time by fi…