h1

h2

h3

h4

h5
h6
%0 Conference Paper
%A Pago, Benedikt Thomas
%T Finite Model Theory and Proof Complexity Revisited : Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus
%V 252
%C Wadern
%I Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
%M RWTH-2023-03532
%B Leibniz International Proceedings in Informatics (LIPIcs)
%P 31:1-31:19
%D 2023
%< 31st EACSL Annual Conference on Computer Science Logic : CSL 2023, February 13-16, 2023, Warsaw, Poland / edited by Bartek Klin, Elaine Pimentel
%B 31. EACSL Annual Conference on Computer Science Logic
%C 13 Feb 2023 - 16 Feb 2023, Warsaw (Poland)
Y2 13 Feb 2023 - 16 Feb 2023
M2 Warsaw, Poland
%K Theory of computation → Finite Model Theory (Other)
%K finite model theory (Other)
%K graph isomorphism (Other)
%K proof complexity (Other)
%F PUB:(DE-HGF)7 ; PUB:(DE-HGF)8
%9 Contribution to a bookContribution to a conference proceedings
%R 10.4230/LIPICS.CSL.2023.31
%U https://publications.rwth-aachen.de/record/955509