A new order-theoretic characterisation of the polytime computable functions (Q2346988): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:19, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new order-theoretic characterisation of the polytime computable functions |
scientific article |
Statements
A new order-theoretic characterisation of the polytime computable functions (English)
0 references
26 May 2015
0 references
term rewriting
0 references
complexity analysis
0 references
implicit computational complexity
0 references
automation
0 references
