## Abstract

Given integers a, b, c, d, we present a polynomial algorithm for the query "is a^{b} ≥ c^{d}?". The result is applied to yield a polynomial algorithm for the minimal cost reliability ratio spanning tree problem.

Original language | English |
---|---|

Pages (from-to) | 117-123 |

Number of pages | 7 |

Journal | Discrete Applied Mathematics |

Volume | 9 |

Issue number | 2 |

DOIs | |

State | Published - Oct 1984 |

## Fingerprint

Dive into the research topics of 'Polynomial testing of the query "IS a^{b}≥ c

^{d}?" with application to finding a minimal cost reliability ratio spanning tree'. Together they form a unique fingerprint.