A typed imperative language whose programs are exactly the polynomial-time computable functions.
In: Structure in Complexity Theory: Proceedings of the Conference held at the Uni- versity of California, Berkeley, California, June 2–5, 1986
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Programming Language for Feasible Solutions
A typed imperative language whose programs are exactly the polynomial-time computable functions.