Search Results - "Benedikt Pago"

A Finite-Model-Theoretic View on Propositional Proof Complexity by Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa

“…We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of…”
Get full text

Choiceless Computation and Symmetry: Limitations of Definability by Pago, Benedikt

“…29th EACSL Annual Conference on Computer Science Logic (CSL 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 183, pp. 33:1-33:21,…”
Get full text

Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits by Pago, Benedikt

“…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…”
Get full text

Finite Model Theory and Proof Complexity revisited: Distinguishing graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus by Pago, Benedikt

“…This paper extends prior work on the connections between logics from finite model theory and propositional/algebraic proof systems. We show that if all…”
Get full text

Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems by Lichter, Moritz, Pago, Benedikt

“…We show that various known algorithms for finite-domain constraint satisfaction problems (CSP), which are based on solving systems of linear equations over the…”
Get full text

Choiceless Polynomial Time, Symmetric Circuits and Cai-F\"urer-Immerman Graphs by Pago, Benedikt

“…Choiceless Polynomial Time (CPT) is currently the only candidate logic for capturing PTIME (that is, it is contained in PTIME and has not been separated from…”
Get full text

Limitations of Game Comonads via Homomorphism Indistinguishability by Lichter, Moritz, Pago, Benedikt, Seppelt, Tim

“…Abramsky, Dawar, and Wang (2017) introduced the pebbling comonad for k-variable counting logic and thereby initiated a line of work that imports category…”
Get full text

A Finite-Model-Theoretic View on Propositional Proof Complexity by Grädel, Erich, Grohe, Martin, Pago, Benedikt, Pakusa, Wied

“…Logical Methods in Computer Science, Volume 15, Issue 1 (June 14, 2022) lmcs:4320 We establish new, and surprisingly tight, connections between propositional…”
Get full text