h1

000955509 001__ 955509
000955509 005__ 20250207134033.0
000955509 0247_ $$2ISBN$$a978-3-95977-264-8
000955509 0247_ $$2ISSN$$a1868-8969
000955509 0247_ $$2SCOPUS$$aSCOPUS:2-s2.0-85148333745
000955509 0247_ $$2doi$$a10.4230/LIPICS.CSL.2023.31
000955509 0247_ $$2datacite_doi$$a10.18154/RWTH-2023-03532
000955509 037__ $$aRWTH-2023-03532
000955509 041__ $$aEnglish
000955509 1001_ $$0P:(DE-82)IDM04024$$aPago, Benedikt Thomas$$b0$$eCorresponding author$$urwth
000955509 1112_ $$a31. EACSL Annual Conference on Computer Science Logic$$cWarsaw$$d2023-02-13 - 2023-02-16$$gCSL 2023$$wPoland
000955509 245__ $$aFinite Model Theory and Proof Complexity Revisited : Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus$$honline
000955509 260__ $$aWadern$$bSchloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH$$c2023
000955509 29510 $$a31st EACSL Annual Conference on Computer Science Logic : CSL 2023, February 13-16, 2023, Warsaw, Poland / edited by Bartek Klin, Elaine Pimentel
000955509 300__ $$a31:1-31:19
000955509 3367_ $$033$$2EndNote$$aConference Paper
000955509 3367_ $$0PUB:(DE-HGF)7$$2PUB:(DE-HGF)$$aContribution to a book$$mcontb
000955509 3367_ $$0PUB:(DE-HGF)8$$2PUB:(DE-HGF)$$aContribution to a conference proceedings$$bcontrib$$mcontrib
000955509 3367_ $$2BibTeX$$aINPROCEEDINGS
000955509 3367_ $$2DRIVER$$aconferenceObject
000955509 3367_ $$2DataCite$$aOutput Types/Conference Paper
000955509 3367_ $$2ORCID$$aCONFERENCE_PAPER
000955509 4900_ $$aLeibniz International Proceedings in Informatics (LIPIcs)$$v252
000955509 588__ $$aDataset connected to DataCite
000955509 591__ $$aGermany
000955509 650_7 $$2Other$$aTheory of computation → Finite Model Theory
000955509 650_7 $$2Other$$afinite model theory
000955509 650_7 $$2Other$$agraph isomorphism
000955509 650_7 $$2Other$$aproof complexity
000955509 7870_ $$0RWTH-2023-03530$$iIsParent
000955509 8564_ $$uhttps://publications.rwth-aachen.de/record/955509/files/955509.pdf$$yOpenAccess
000955509 909CO $$ooai:publications.rwth-aachen.de:955509$$pdnbdelivery$$pdriver$$pVDB$$popen_access$$popenaire
000955509 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM04024$$aRWTH Aachen$$b0$$kRWTH
000955509 9141_ $$y2023
000955509 9151_ $$0StatID:(DE-HGF)0031$$2StatID$$aPeer reviewed article$$x0
000955509 915__ $$0StatID:(DE-HGF)0510$$2StatID$$aOpenAccess
000955509 915__ $$0LIC:(DE-HGF)CCBY4$$2HGFVOC$$aCreative Commons Attribution CC BY 4.0
000955509 9201_ $$0I:(DE-82)117220_20140620$$k117220$$lLehr- und Forschungsgebiet Mathematische Grundlagen der Informatik (Logik und Komplexität)$$x0
000955509 9201_ $$0I:(DE-82)110000_20140620$$k110000$$lFachgruppe Mathematik$$x1
000955509 961__ $$c2023-04-03T15:18:57.872674$$x2023-04-03T15:18:57.872674$$z2023-04-04
000955509 9801_ $$aFullTexts
000955509 980__ $$aI:(DE-82)110000_20140620
000955509 980__ $$aI:(DE-82)117220_20140620
000955509 980__ $$aUNRESTRICTED
000955509 980__ $$aVDB
000955509 980__ $$acontb
000955509 980__ $$acontrib