Standard
The exact hardness of deciding derivational and runtime complexity. / Schnabl, Andreas; Simonsen, Jakob Grue.
Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. ed. / Marc Bezem. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011. p. 481-495 (Leibniz International Proceedings in Informatics, Vol. 12).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Schnabl, A
& Simonsen, JG 2011,
The exact hardness of deciding derivational and runtime complexity. in M Bezem (ed.),
Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics, vol. 12, pp. 481-495, 25th International Workshop on Computer Science Logic, Bergen, Norway,
12/09/2011.
https://doi.org/10.4230/LIPIcs.CSL.2011.481
APA
Schnabl, A.
, & Simonsen, J. G. (2011).
The exact hardness of deciding derivational and runtime complexity. In M. Bezem (Ed.),
Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL (pp. 481-495). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Leibniz International Proceedings in Informatics Vol. 12
https://doi.org/10.4230/LIPIcs.CSL.2011.481
Vancouver
Schnabl A
, Simonsen JG.
The exact hardness of deciding derivational and runtime complexity. In Bezem M, editor, Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 2011. p. 481-495. (Leibniz International Proceedings in Informatics, Vol. 12).
https://doi.org/10.4230/LIPIcs.CSL.2011.481
Author
Schnabl, Andreas ; Simonsen, Jakob Grue. / The exact hardness of deciding derivational and runtime complexity. Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. editor / Marc Bezem. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011. pp. 481-495 (Leibniz International Proceedings in Informatics, Vol. 12).
Bibtex
@inproceedings{6e25fe8f903c48c1bc298a7f1ab518f6,
title = "The exact hardness of deciding derivational and runtime complexity",
author = "Andreas Schnabl and Simonsen, {Jakob Grue}",
year = "2011",
doi = "10.4230/LIPIcs.CSL.2011.481",
language = "English",
series = "Leibniz International Proceedings in Informatics",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
pages = "481--495",
editor = "Marc Bezem",
booktitle = "Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL",
note = "null ; Conference date: 12-09-2011 Through 15-09-2011",
}
RIS
TY - GEN
T1 - The exact hardness of deciding derivational and runtime complexity
AU - Schnabl, Andreas
AU - Simonsen, Jakob Grue
N1 - Conference code: 25
PY - 2011
Y1 - 2011
U2 - 10.4230/LIPIcs.CSL.2011.481
DO - 10.4230/LIPIcs.CSL.2011.481
M3 - Article in proceedings
T3 - Leibniz International Proceedings in Informatics
SP - 481
EP - 495
BT - Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL
A2 - Bezem, Marc
PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Y2 - 12 September 2011 through 15 September 2011
ER -