A predicative and decidable characterization of the polynomial classes of languages (Q1589422): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Salvatore Caporaso / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Michele Zito / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Nicola Galesi / rank | |||
Normal rank | |||
Revision as of 13:02, 14 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A predicative and decidable characterization of the polynomial classes of languages |
scientific article |
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
