A predicative and decidable characterization of the polynomial classes of languages (Q1589422)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1542259
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A predicative and decidable characterization of the polynomial classes of languages |
scientific article; zbMATH DE number 1542259 |
Statements
A predicative and decidable characterization of the polynomial classes of languages (English)
0 references
12 December 2000
0 references
computational complexity
0 references
predicative recursion
0 references
functional programming
0 references
Lisp
0 references
0.7714686393737793
0 references
0.7588427662849426
0 references
0.7504222393035889
0 references
0.7468328475952148
0 references
