On the polynomial complexity of the equivalence checking problem in algebraic models of programs (Q2452734)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the polynomial complexity of the equivalence checking problem in algebraic models of programs |
scientific article |
Statements
On the polynomial complexity of the equivalence checking problem in algebraic models of programs (English)
0 references
5 June 2014
0 references
algebraic model of programs
0 references
program scheme
0 references
equivalence
0 references
algorithmic decidability
0 references
computational complexity
0 references
