Polynomial testing of the query ''Is \(a^ b\geq c^ d?''\) with application to finding a minimal cost reliability ratio spanning tree (Q800816)
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 3878649
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial testing of the query ''Is \(a^ b\geq c^ d?''\) with application to finding a minimal cost reliability ratio spanning tree |
scientific article; zbMATH DE number 3878649 |
Statements
Polynomial testing of the query ''Is \(a^ b\geq c^ d?''\) with application to finding a minimal cost reliability ratio spanning tree (English)
0 references
1984
0 references
Given integers a, b, c, d, we present a polynomial algorithm for the query ''is \(a^ b\geq c^ d?''\). The result is applied to yield a polynomial algorithm for the minimal cost reliability ratio spanning tree problem.
0 references
polynomial algorithm
0 references
minimal cost reliability ratio spanning tree
0 references
0 references
0.7086936831474304
0 references
0.7081469297409058
0 references
0.7067955732345581
0 references
0.6876313090324402
0 references
