๐ฎ
๐ฎ
The Ethereal
Cons-free Programs and Complexity Classes between LOGSPACE and PTIME
August 07, 2020 ยท The Ethereal ยท ๐ VPT/HCVS@ETAPS
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Neil D. Jones, Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen
arXiv ID
2008.02932
Category
cs.CC: Computational Complexity
Cross-listed
cs.PL
Citations
1
Venue
VPT/HCVS@ETAPS
Last Checked
2 months ago
Abstract
Programming language concepts are used to give some new perspectives on a long-standing open problem: is logspace = ptime ?
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Computational Complexity
๐ฎ
๐ฎ
The Ethereal
An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
๐ฎ
๐ฎ
The Ethereal
The Parallelism Tradeoff: Limitations of Log-Precision Transformers
๐ฎ
๐ฎ
The Ethereal
The Hardness of Approximation of Euclidean k-means
๐ฎ
๐ฎ
The Ethereal
Slightly Superexponential Parameterized Problems
๐ฎ
๐ฎ
The Ethereal