Benedikt Pago
From MaRDI portal
Person:4625691
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Choiceless computation and symmetry: limitations of definability | 2026-03-23 | Paper |
| Limitations of game comonads for invertible-map equivalence via homomorphism indistinguishability | 2026-02-19 | Paper |
| Lower bounds for choiceless polynomial time via symmetric XOR-circuits | 2024-12-03 | Paper |
| Finite model theory and proof complexity revisited: distinguishing graphs in choiceless polynomial time and the extended polynomial calculus | 2024-09-25 | Paper |
| scientific article; zbMATH DE number 7204319 (Why is no real title available?) | 2020-05-26 | Paper |
| A finite-model-theoretic view on propositional proof complexity (available as arXiv preprint) | 2019-02-25 | Paper |
Research outcomes over time
This page was built for person: Benedikt Pago
