001 | 955509 | ||
005 | 20250207134033.0 | ||
024 | 7 | _ | |2 ISBN |a 978-3-95977-264-8 |
024 | 7 | _ | |2 ISSN |a 1868-8969 |
024 | 7 | _ | |2 SCOPUS |a SCOPUS:2-s2.0-85148333745 |
024 | 7 | _ | |2 doi |a 10.4230/LIPICS.CSL.2023.31 |
024 | 7 | _ | |2 datacite_doi |a 10.18154/RWTH-2023-03532 |
037 | _ | _ | |a RWTH-2023-03532 |
041 | _ | _ | |a English |
100 | 1 | _ | |0 P:(DE-82)IDM04024 |a Pago, Benedikt Thomas |b 0 |e Corresponding author |u rwth |
111 | 2 | _ | |a 31. EACSL Annual Conference on Computer Science Logic |c Warsaw |d 2023-02-13 - 2023-02-16 |g CSL 2023 |w Poland |
245 | _ | _ | |a Finite Model Theory and Proof Complexity Revisited : Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus |h online |
260 | _ | _ | |a Wadern |b Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH |c 2023 |
295 | 1 | 0 | |a 31st EACSL Annual Conference on Computer Science Logic : CSL 2023, February 13-16, 2023, Warsaw, Poland / edited by Bartek Klin, Elaine Pimentel |
300 | _ | _ | |a 31:1-31:19 |
336 | 7 | _ | |0 33 |2 EndNote |a Conference Paper |
336 | 7 | _ | |0 PUB:(DE-HGF)7 |2 PUB:(DE-HGF) |a Contribution to a book |m contb |
336 | 7 | _ | |0 PUB:(DE-HGF)8 |2 PUB:(DE-HGF) |a Contribution to a conference proceedings |b contrib |m contrib |
336 | 7 | _ | |2 BibTeX |a INPROCEEDINGS |
336 | 7 | _ | |2 DRIVER |a conferenceObject |
336 | 7 | _ | |2 DataCite |a Output Types/Conference Paper |
336 | 7 | _ | |2 ORCID |a CONFERENCE_PAPER |
490 | 0 | _ | |a Leibniz International Proceedings in Informatics (LIPIcs) |v 252 |
588 | _ | _ | |a Dataset connected to DataCite |
591 | _ | _ | |a Germany |
650 | _ | 7 | |2 Other |a Theory of computation → Finite Model Theory |
650 | _ | 7 | |2 Other |a finite model theory |
650 | _ | 7 | |2 Other |a graph isomorphism |
650 | _ | 7 | |2 Other |a proof complexity |
787 | 0 | _ | |0 RWTH-2023-03530 |i IsParent |
856 | 4 | _ | |u https://publications.rwth-aachen.de/record/955509/files/955509.pdf |y OpenAccess |
909 | C | O | |o oai:publications.rwth-aachen.de:955509 |p openaire |p open_access |p VDB |p driver |p dnbdelivery |
910 | 1 | _ | |0 I:(DE-588b)36225-6 |6 P:(DE-82)IDM04024 |a RWTH Aachen |b 0 |k RWTH |
914 | 1 | _ | |y 2023 |
915 | 1 | _ | |0 StatID:(DE-HGF)0031 |2 StatID |a Peer reviewed article |x 0 |
915 | _ | _ | |0 StatID:(DE-HGF)0510 |2 StatID |a OpenAccess |
915 | _ | _ | |0 LIC:(DE-HGF)CCBY4 |2 HGFVOC |a Creative Commons Attribution CC BY 4.0 |
920 | 1 | _ | |0 I:(DE-82)117220_20140620 |k 117220 |l Lehr- und Forschungsgebiet Mathematische Grundlagen der Informatik (Logik und Komplexität) |x 0 |
920 | 1 | _ | |0 I:(DE-82)110000_20140620 |k 110000 |l Fachgruppe Mathematik |x 1 |
980 | 1 | _ | |a FullTexts |
980 | _ | _ | |a I:(DE-82)110000_20140620 |
980 | _ | _ | |a I:(DE-82)117220_20140620 |
980 | _ | _ | |a UNRESTRICTED |
980 | _ | _ | |a VDB |
980 | _ | _ | |a contb |
980 | _ | _ | |a contrib |
Library | Collection | CLSMajor | CLSMinor | Language | Author |
---|