guest ::
Symmetric Proofs in the Ideal Proof System
; ; ;
2025
Online
DOI: 10.48550/arXiv.2504.16820
DOI: 10.18154/RWTH-2026-04739
URL: https://publications.rwth-aachen.de/record/1034471/files/1034471.pdf
Einrichtungen
- Lehr- und Forschungsgebiet Mathematische Grundlagen der Informatik (Logik und Komplexität) (117220)
- Fachgruppe Mathematik (110000)
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
External link: 
Fulltext by arXiv.org
Dokumenttyp
Preprint
Format
online
Sprache
English
Externe Identnummern
arXiv: arXiv:2504.16820
Interne Identnummern
RWTH-2026-04739
Datensatz-ID: 1034471
Beteiligte Länder
Germany, UK
Related:
Contribution to a book/Contribution to a conference proceedings
Symmetric Proofs in the Ideal Proof System
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
50. International Symposium on Mathematical Foundations of Computer Science, MFCS 2025, WarsawWarsaw, Poland, 25 Aug 2025 - 29 Aug 2025
Saarbrücken/Wadern, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 345, 40:1-40:18 (2025) [10.4230/LIPICS.MFCS.2025.40]
Files
BibTeX |
EndNote:
XML,
Text |
RIS
; 
