The Complexity of the Equivalence Problem for Simple Programs (Q3912019): Difference between revisions
From MaRDI portal
Added link to MaRDI 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.1145/322261.322270 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1985456258 / rank | |||
Normal rank | |||
Latest revision as of 22:43, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of the Equivalence Problem for Simple Programs |
scientific article |
Statements
The Complexity of the Equivalence Problem for Simple Programs (English)
0 references
1981
0 references
simple programming languages
0 references
Presburger formulas
0 references
counter machines
0 references
polynomial space
0 references
polynomial time
0 references
NP-complete
0 references
