guest ::
Finite Model Theory and Proof Complexity Revisited : Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus
In
31st EACSL Annual Conference on Computer Science Logic : CSL 2023, February 13-16, 2023, Warsaw, Poland / edited by Bartek Klin, Elaine Pimentel, Seiten/Artikel-Nr: 31:1-31:19
2023
Online
DOI: 10.4230/LIPICS.CSL.2023.31
DOI: 10.18154/RWTH-2023-03532
URL: https://publications.rwth-aachen.de/record/955509/files/955509.pdf
Einrichtungen
- Lehr- und Forschungsgebiet Mathematische Grundlagen der Informatik (Logik und Komplexität) (117220)
- Fachgruppe Mathematik (110000)
Inhaltliche Beschreibung (Schlagwörter)
Theory of computation → Finite Model Theory (Genormte SW) ; finite model theory (Genormte SW) ; graph isomorphism (Genormte SW) ; proof complexity (Genormte SW)
OpenAccess: 
PDF
Dokumenttyp
Contribution to a book/Contribution to a conference proceedings
Format
online
Sprache
English
Anmerkung
Peer reviewed article
Externe Identnummern
SCOPUS: SCOPUS:2-s2.0-85148333745
Interne Identnummern
RWTH-2023-03532
Datensatz-ID: 955509
Beteiligte Länder
Germany
Related:
Preprint
Finite Model Theory and Proof Complexity revisited: Distinguishing graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus
BibTeX |
EndNote:
XML,
Text |
RIS
; 
PDF