Standard
Cons-free programs and complexity classes between LOGSPACE and PTIME. / Jones, Neil D.; Bhaskar, Siddharth; Kop, Cynthia; Simonsen, Jakob Grue.
In:
Electronic Proceedings in Theoretical Computer Science, Vol. 320, 2020, p. 65-79.
Research output: Contribution to journal › Conference article › Research › peer-review
Harvard
Jones, ND, Bhaskar, S, Kop, C
& Simonsen, JG 2020, '
Cons-free programs and complexity classes between LOGSPACE and PTIME',
Electronic Proceedings in Theoretical Computer Science, vol. 320, pp. 65-79.
https://doi.org/10.4204/EPTCS.320.5APA
Jones, N. D., Bhaskar, S., Kop, C.
, & Simonsen, J. G. (2020).
Cons-free programs and complexity classes between LOGSPACE and PTIME.
Electronic Proceedings in Theoretical Computer Science,
320, 65-79.
https://doi.org/10.4204/EPTCS.320.5Vancouver
Jones ND, Bhaskar S, Kop C
, Simonsen JG.
Cons-free programs and complexity classes between LOGSPACE and PTIME.
Electronic Proceedings in Theoretical Computer Science. 2020;320:65-79.
https://doi.org/10.4204/EPTCS.320.5Author
Jones, Neil D. ; Bhaskar, Siddharth ; Kop, Cynthia ; Simonsen, Jakob Grue. / Cons-free programs and complexity classes between LOGSPACE and PTIME. In: Electronic Proceedings in Theoretical Computer Science. 2020 ; Vol. 320. pp. 65-79.
Bibtex
@inproceedings{141c58ae98db4587a148bd9155b73792,
title = "Cons-free programs and complexity classes between LOGSPACE and PTIME",
abstract = "Programming language concepts are used to give some new perspectives on a long-standing open problem: is LOGSPACE = PTIME ?.",
author = "Jones, {Neil D.} and Siddharth Bhaskar and Cynthia Kop and Simonsen, {Jakob Grue}",
year = "2020",
doi = "10.4204/EPTCS.320.5",
language = "English",
volume = "320",
pages = "65--79",
journal = "Electronic Proceedings in Theoretical Computer Science",
issn = "2075-2180",
publisher = "Open Publishing Association",
note = "8th International Workshop on Verification and Program Transformation, VPT 2020 and 7th Workshop on Horn Clauses for Verification and Synthesis, HCVS 2020 ; Conference date: 25-04-2020 Through 26-04-2020",
}
RIS
TY - GEN
T1 - Cons-free programs and complexity classes between LOGSPACE and PTIME
AU - Jones, Neil D.
AU - Bhaskar, Siddharth
AU - Kop, Cynthia
AU - Simonsen, Jakob Grue
PY - 2020
Y1 - 2020
N2 - Programming language concepts are used to give some new perspectives on a long-standing open problem: is LOGSPACE = PTIME ?.
AB - Programming language concepts are used to give some new perspectives on a long-standing open problem: is LOGSPACE = PTIME ?.
U2 - 10.4204/EPTCS.320.5
DO - 10.4204/EPTCS.320.5
M3 - Conference article
AN - SCOPUS:85091988483
VL - 320
SP - 65
EP - 79
JO - Electronic Proceedings in Theoretical Computer Science
JF - Electronic Proceedings in Theoretical Computer Science
SN - 2075-2180
T2 - 8th International Workshop on Verification and Program Transformation, VPT 2020 and 7th Workshop on Horn Clauses for Verification and Synthesis, HCVS 2020
Y2 - 25 April 2020 through 26 April 2020
ER -
