Dynamic Programming as Graph Searching: An Algebraic Approach (Q3926375): 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/322276.322285 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2078945336 / rank | |||
Normal rank | |||
Latest revision as of 21:49, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic Programming as Graph Searching: An Algebraic Approach |
scientific article |
Statements
Dynamic Programming as Graph Searching: An Algebraic Approach (English)
0 references
1981
0 references
algebraic approach
0 references
minimal cost path
0 references
symbolic system
0 references
semantics of programming languages
0 references
functional equations
0 references
AND/OR graph
0 references
graph search
0 references
continuous algebras
0 references
algebraic semantics
0 references
