Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space (Q2978550)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space |
scientific article |
Statements
25 April 2017
0 references
reachability problem
0 references
space complexity
0 references
unambiguous algorithms
0 references
Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space (English)
0 references
