h1

h2

h3

h4

h5
h6
http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png

A Finite-Model-Theoretic View on Propositional Proof Complexity

; ; ;

Umfang53 Seiten

Online
DOI: 10.48550/ARXIV.1802.09377


Einrichtungen

  1. Lehr- und Forschungsgebiet Mathematische Grundlagen der Informatik (Logik und Komplexität) (117220)
  2. Fachgruppe Mathematik (110000)
  3. Lehrstuhl für Informatik 7 (Logik und Theorie diskreter Systeme) (122910)
  4. Fachgruppe Informatik (120000)


External link:
Download fulltext
Fulltext by arXiv.org

Dokumenttyp
Preprint

Format
online

Sprache
English

Externe Identnummern
arXiv: arXiv:1802.09377

Interne Identnummern
RWTH-2018-221672
Datensatz-ID: 718317

Beteiligte Länder
Germany, UK

 GO

Related:

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Journal Article  ;  ;  ;
A Finite-Model-Theoretic View on Propositional Proof Complexity
Logical methods in computer science : LMCS 15(1), 4:1-4:53 () [10.23638/LMCS-15(1:4)2019]  GO OpenAccess  Download fulltext Files BibTeX | EndNote: XML, Text | RIS

QR Code for this record

The record appears in these collections:
Document types > Other document types > Preprints
Faculty of Mathematics and Natural Sciences (Fac.1) > Department of Mathematics
Faculty of Computer Science (Fac.9)
Public records
Publications database
120000
110000
122910
117220
 Record created 2018-02-28, last modified 2025-10-27
Similar records


External link:
Download fulltext
Fulltext by arXiv.org
Rate this document:

Rate this document:
1
2
3
4
5
 
(Not yet reviewed)