@inproceedings{https://doi.org/10.4230/lipics.csl.2023.31,
    doi = {10.4230/LIPICS.CSL.2023.31},
    url = {https://drops.dagstuhl.de/opus/volltexte/2023/17492/},
    author = {Pago, Benedikt},
    keywords = {finite model theory, proof complexity, graph isomorphism, Theory of computation → Finite Model Theory},
    language = {en},
    title = {Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus},
    publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
    year = {2023},
    copyright = {Creative Commons Attribution 4.0 International license},
    date-added = {2023-11-24 7:11:54 +0100}
}

@inproceedings{https://doi.org/10.4230/lipics.csl.2023.31, doi = {10.4230/LIPICS.CSL.2023.31}, url = {https://drops.dagstuhl.de/opus/volltexte/2023/17492/}, author = {Pago, Benedikt}, keywords = {finite model theory, proof complexity, graph isomorphism, Theory of computation → Finite Model Theory}, language = {en}, title = {Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, year = {2023}, copyright = {Creative Commons Attribution 4.0 International license}, date-added = {2023-11-24 7:11:54 +0100} }