Polynomial testing of the query ''Is \(a^ b\geq c^ d?''\) with application to finding a minimal cost reliability ratio spanning tree (Q800816): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q176435 |
||
| Property / author | |||
| Property / author: Arie Tamir / rank | |||
Revision as of 06:41, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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 |
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
