The general quasi-order algorithm in number theory
This paper deals with a generalization of the Binary Quasi-Order Theorem. This generalization involves a more complicated algorithm than (0.2)t. Some remarks are made on relative merits of two dual algorithms called the ψ-algorithm and the ϕ-algorithm. Some illustrative examples are given.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1986-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171286000297 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|