h1

h2

h3

h4

h5
h6
%0 Electronic Article
%A Pago, Benedikt Thomas
%T Finite Model Theory and Proof Complexity revisited: Distinguishing graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus
%M RWTH-2023-03530
%D 2022
%F PUB:(DE-HGF)25
%9 Preprint
%U https://publications.rwth-aachen.de/record/955507