The Complexity of the Equivalence Problem for Simple Programs (Q3912019): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 21:59, 5 February 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