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 the normal view instead:
scientific article; zbMATH DE number 6707798
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial min/max-weighted reachability is in unambiguous log-space |
scientific article; zbMATH DE number 6707798 |
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
0.965438723564148
0 references
0.7737012505531311
0 references
0.7667961716651917
0 references
0.7518521547317505
0 references
0.7284862399101257
0 references
