Benedikt Pago

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 14

Top Topics

Finite Model Theory

Top Venues

ACM SIGLOG News

Publications

Moritz Lichter, Benedikt Pago, Tim Seppelt
Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability. CSL (2024)
Moritz Lichter, Benedikt Pago
Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems. CoRR (2024)
Benedikt Pago
Choiceless Computation and Symmetry: Limitations of Definability. CoRR (2024)
Anuj Dawar, Benedikt Pago
A Logic for P: Are we Nearly There Yet? ACM SIGLOG News 11 (2) (2024)
Benedikt Pago
Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits. CoRR (2023)
Benedikt Pago
Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus. CSL (2023)
Moritz Lichter, Benedikt Pago, Tim Seppelt
Limitations of Game Comonads via Homomorphism Indistinguishability. CoRR (2023)
Benedikt Pago
Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-Circuits. MFCS (2023)
Benedikt Pago
Finite Model Theory and Proof Complexity revisited: Distinguishing graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus. CoRR (2022)
Benedikt Pago
Choiceless Polynomial Time, Symmetric Circuits and Cai-Fürer-Immerman Graphs. CoRR (2021)
Benedikt Pago
Choiceless Computation and Symmetry: Limitations of Definability. CSL (2021)
Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa
A Finite-Model-Theoretic View on Propositional Proof Complexity. Log. Methods Comput. Sci. 15 (1) (2019)
Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa
A Finite-Model-Theoretic View on Propositional Proof Complexity. CoRR (2018)
Erich Grädel, Benedikt Pago, Wied Pakusa
The Model-Theoretic Expressiveness of Propositional Proof Systems. CSL (2017)