Gast ::
TY - CONF AU - Pago, Benedikt Thomas TI - Finite Model Theory and Proof Complexity Revisited : Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus VL - 252 CY - Wadern PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH M1 - RWTH-2023-03532 T2 - Leibniz International Proceedings in Informatics (LIPIcs) SP - 31:1-31:19 PY - 2023 T2 - 31. EACSL Annual Conference on Computer Science Logic CY - 13 Feb 2023 - 16 Feb 2023, Warsaw (Poland) Y2 - 13 Feb 2023 - 16 Feb 2023 M2 - Warsaw, Poland KW - Theory of computation → Finite Model Theory (Other) KW - finite model theory (Other) KW - graph isomorphism (Other) KW - proof complexity (Other) LB - PUB:(DE-HGF)7 ; PUB:(DE-HGF)8 DO - DOI:10.4230/LIPICS.CSL.2023.31 UR - https://publications.rwth-aachen.de/record/955509 ER -