Cons-free Programs and Complexity Classes between LOGSPACE and PTIME
Neil D. Jones (University of Copenhagen), Siddharth Bhaskar, (University of Copenhagen), Cynthia Kop (Radboud University, Nijmegen), Jakob, Grue Simonsen (University of Copenhagen)
TL;DR
This paper explores the relationship between logspace and ptime complexity classes using programming language concepts, offering new perspectives on whether these classes are equal.
Contribution
It introduces a novel approach using cons-free programs to analyze complexity classes between LOGSPACE and PTIME.
Findings
Provides new insights into the complexity class hierarchy
Suggests potential separations or equalities between LOGSPACE and PTIME
Offers a framework for future research in complexity theory
Abstract
Programming language concepts are used to give some new perspectives on a long-standing open problem: is logspace = ptime ?
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.