Search Results - Open Polar - "Computational complexity theory"

Select result number 1
1

Degrees of Second and Higher-Order Polynomials

by Lim, Donghyun, Ziegler, Martin
Published 2023
“... computational complexity theory, extending for example classical classes like P or PSPACE to operators...”

Get access

Text
Select result number 2
2

Degrees of Second and Higher-Order Polynomials ...

by Lim, Donghyun, Ziegler, Martin
Published 2023
“... computational complexity theory, extending for example classical classes like P or PSPACE to operators...”

Get access
Get access

Report
Select result number 3
3

The Weak Call-By-Value λ-Calculus is Reasonable for Both Time and Space

by Forster, Yannick, Kunze, Fabian, Roth, Marc
Published 2019
“...We study the weak call-by-value $λ$-calculus as a model for computational complexity theory...”

Get access
Get access

Report
Select result number 4
4

The Weak Call-By-Value {\lambda}-Calculus is Reasonable for Both Time and Space

by Forster, Yannick, Kunze, Fabian, Roth, Marc
Published in Proceedings of the ACM on Programming Languages (2019)
“...We study the weak call-by-value $\lambda$-calculus as a model for computational complexity theory...”

Get access
Get access

Text