Cons-free Programs and Complexity Classes between LOGSPACE and PTIME

Neil D. Jones; Siddharth Bhaskar; Cynthia Kop; Jakob Grue Simonsen

doi:10.4204/EPTCS.320.5

Cons-free Programs and Complexity Classes between LOGSPACE and PTIME

Computational Complexity 2020-08-10 v1 Programming Languages

Authors: Neil D. Jones , Siddharth Bhaskar , Cynthia Kop , Jakob Grue Simonsen

View on arXiv ↗ PDF ↗ DOI ↗

Abstract

Programming language concepts are used to give some new perspectives on a long-standing open problem: is logspace = ptime ?

Cite

@article{arxiv.2008.02932,
  title  = {Cons-free Programs and Complexity Classes between LOGSPACE and PTIME},
  author = {Neil D. Jones and Siddharth Bhaskar and Cynthia Kop and Jakob Grue Simonsen},
  journal= {arXiv preprint arXiv:2008.02932},
  year   = {2020}
}