guest ::
Finite Model Theory and Proof Complexity revisited: Distinguishing graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus
2022
Einrichtungen
- Lehr- und Forschungsgebiet Mathematische Grundlagen der Informatik (Logik und Komplexität) (117220)
- Fachgruppe Mathematik (110000)
Dokumenttyp
Preprint
Format
online
Sprache
English
Interne Identnummern
RWTH-2023-03530
Datensatz-ID: 955507
Beteiligte Länder
Germany
Related:
Contribution to a book/Contribution to a conference proceedings
Finite Model Theory and Proof Complexity Revisited : Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus
31st EACSL Annual Conference on Computer Science Logic : CSL 2023, February 13-16, 2023, Warsaw, Poland / edited by Bartek Klin, Elaine Pimentel
31. EACSL Annual Conference on Computer Science Logic, CSL 2023, WarsawWarsaw, Poland, 13 Feb 2023 - 16 Feb 2023
Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Leibniz International Proceedings in Informatics (LIPIcs) 252, 31:1-31:19 (2023) [10.4230/LIPICS.CSL.2023.31]
Files
BibTeX |
EndNote:
XML,
Text |
RIS
|
The record appears in these collections: |