Gast ::
| 001 | 955507 | ||
| 005 | 20241111073941.0 | ||
| 037 | _ | _ | |a RWTH-2023-03530 |
| 041 | _ | _ | |a English |
| 100 | 1 | _ | |0 P:(DE-82)IDM04024 |a Pago, Benedikt Thomas |b 0 |e Corresponding author |u rwth |
| 245 | _ | _ | |a Finite Model Theory and Proof Complexity revisited: Distinguishing graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus |h online |
| 260 | _ | _ | |c 2022 |
| 336 | 7 | _ | |0 28 |2 EndNote |a Electronic Article |
| 336 | 7 | _ | |0 PUB:(DE-HGF)25 |2 PUB:(DE-HGF) |a Preprint |b preprint |m preprint |s 1680527316_31709 |
| 336 | 7 | _ | |2 BibTeX |a ARTICLE |
| 336 | 7 | _ | |2 DRIVER |a preprint |
| 336 | 7 | _ | |2 DataCite |a Output Types/Working Paper |
| 336 | 7 | _ | |2 ORCID |a WORKING_PAPER |
| 588 | _ | _ | |a Dataset connected to DataCite |
| 591 | _ | _ | |a Germany |
| 910 | 1 | _ | |0 I:(DE-588b)36225-6 |6 P:(DE-82)IDM04024 |a RWTH Aachen |b 0 |k RWTH |
| 914 | 1 | _ | |y 2022 |
| 920 | 1 | _ | |0 I:(DE-82)117220_20140620 |k 117220 |l Lehr- und Forschungsgebiet Mathematische Grundlagen der Informatik (Logik und Komplexität) |x 0 |
| 920 | 1 | _ | |0 I:(DE-82)110000_20140620 |k 110000 |l Fachgruppe Mathematik |x 1 |
| 980 | _ | _ | |a I:(DE-82)110000_20140620 |
| 980 | _ | _ | |a I:(DE-82)117220_20140620 |
| 980 | _ | _ | |a UNRESTRICTED |
| 980 | _ | _ | |a VDBINPRINT |
| 980 | _ | _ | |a preprint |
| Library | Collection | CLSMajor | CLSMinor | Language | Author |
|---|