; ; ;
In
50th International Symposium on Mathematical Foundations of Computer Science : MFCS 2025, August 25-29, 2025, Warsaw, Poland / edited by Paweł Gawrychowski, Filip Mazowiecki, Michał Skrzypczak, Seiten/Artikel-Nr: 40:1-40:18
2025
Online
DOI: 10.4230/LIPICS.MFCS.2025.40
DOI: 10.18154/RWTH-2026-04720
URL: https://publications.rwth-aachen.de/record/1034443/files/1034443.pdf
Einrichtungen
Inhaltliche Beschreibung (Schlagwörter)
Theory of computation → Algebraic complexity theory (Genormte SW) ; Theory of computation → Finite Model Theory (Genormte SW) ; Theory of computation → Proof complexity (Genormte SW) ; algebraic complexity (Genormte SW) ; descriptive complexity (Genormte SW) ; graph isomorphism (Genormte SW) ; proof complexity (Genormte SW) ; symmetric circuits (Genormte SW)
OpenAccess:
PDF
Dokumenttyp
Contribution to a book/Contribution to a conference proceedings
Format
online
Sprache
English
Anmerkung
Peer review status of article unknown
Externe Identnummern
SCOPUS: SCOPUS:2-s2.0-105014727767
WOS Core Collection: WOS:001737701200040
Interne Identnummern
RWTH-2026-04720
Datensatz-ID: 1034443
Beteiligte Länder
Germany, UK
Preprint
Symmetric Proofs in the Ideal Proof System
35 Seiten (2025) [10.48550/arXiv.2504.16820]
Files
Fulltext by arXiv.org
BibTeX |
EndNote:
XML,
Text |
RIS