Finite Model Theory and Proof Complexity revisited: Distinguishing graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus
Pago, Benedikt Thomas (Corresponding author)
(2022)
Preprint
Institutions
- Department of Mathematics [110000]
- Mathematical Fundamentals of Computer Science (Logic and Complexity) Teaching and Research Area [117220]
Identifier
- DOI: 10.48550/arXiv.2206.05086
- RWTH PUBLICATIONS: RWTH-2023-03530