Benedikt Pago

According to our database, Benedikt Pago authored at least 16 papers between 2017 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Preservation Theorems in Semiring Semantics.

Sophie Brinke, Anuj Dawar, Erich Grädel, Benedikt Pago

CoRR, May, 2026

Optimal Lower Bounds for Symmetric Modular Circuits.

Benedikt Pago

CoRR, April, 2026

Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials.

Prateek Dwivedi, Benedikt Pago, Tim Seppelt

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

Symmetric Algebraic Circuits and Homomorphism Polynomials.

Anuj Dawar, Benedikt Pago, Tim Seppelt

Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

Arity Hierarchies for Quantifiers Closed Under Partial Polymorphisms.

Anuj Dawar, Lauri Hella, Benedikt Pago

Proceedings of the 34th EACSL Annual Conference on Computer Science Logic, 2026

2025

Symmetric Proofs in the Ideal Proof System.

Anuj Dawar, Erich Grädel, Leon Kullmann, Benedikt Pago

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems.

Moritz Lichter, Benedikt Pago

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

A Logic for P: Are we Nearly There Yet?

Anuj Dawar, Benedikt Pago

ACM SIGLOG News, April, 2024

Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability.

Moritz Lichter, Benedikt Pago, Tim Seppelt

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023

Limitations of choiceless computation.

Benedikt Pago

PhD thesis, 2023

Limitations of Game Comonads via Homomorphism Indistinguishability.

Moritz Lichter, Benedikt Pago, Tim Seppelt

CoRR, 2023

Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-Circuits.

Benedikt Pago

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus.

Benedikt Pago

Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2021

Choiceless Computation and Symmetry: Limitations of Definability.

Benedikt Pago

Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2019

A Finite-Model-Theoretic View on Propositional Proof Complexity.

Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa

Log. Methods Comput. Sci., 2019

2017

The Model-Theoretic Expressiveness of Propositional Proof Systems.

Erich Grädel, Benedikt Pago, Wied Pakusa

Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017