Cons-free programs and complexity classes between LOGSPACE and PTIME
Publikation: Bidrag til tidsskrift › Konferenceartikel › Forskning › fagfællebedømt
Programming language concepts are used to give some new perspectives on a long-standing open problem: is LOGSPACE = PTIME ?.
Originalsprog | Engelsk |
---|---|
Tidsskrift | Electronic Proceedings in Theoretical Computer Science |
Vol/bind | 320 |
Sider (fra-til) | 65-79 |
ISSN | 2075-2180 |
DOI | |
Status | Udgivet - 2020 |
Begivenhed | 8th International Workshop on Verification and Program Transformation, VPT 2020 and 7th Workshop on Horn Clauses for Verification and Synthesis, HCVS 2020 - Dublin, Irland Varighed: 25 apr. 2020 → 26 apr. 2020 |
Konference
Konference | 8th International Workshop on Verification and Program Transformation, VPT 2020 and 7th Workshop on Horn Clauses for Verification and Synthesis, HCVS 2020 |
---|---|
Land | Irland |
By | Dublin |
Periode | 25/04/2020 → 26/04/2020 |
Links
- https://arxiv.org/pdf/2008.02932v1.pdf
Forlagets udgivne version
ID: 250258439