No. Title Author Year
1 Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus Pago, Benedikt 2023
2 Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-Circuits Pago, Benedikt 2023
3 Choiceless Computation and Symmetry: Limitations of Definability Pago, Benedikt 2021
4 The Model-Theoretic Expressiveness of Propositional Proof Systems Grädel, Erich et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 4

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI