On the Computational Complexity of Program Scheme Equivalence (Q3893301): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0209031 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1963980186 / rank | |||
Normal rank | |||
Latest revision as of 14:31, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Computational Complexity of Program Scheme Equivalence |
scientific article |
Statements
On the Computational Complexity of Program Scheme Equivalence (English)
0 references
1980
0 references
program scheme equivalence
0 references
decidable problems
0 references
programming languages
0 references
recursion scheme
0 references
