The general quasi-order algorithm in number theory (Q1075347)
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 3950605
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The general quasi-order algorithm in number theory |
scientific article; zbMATH DE number 3950605 |
Statements
The general quasi-order algorithm in number theory (English)
0 references
1986
0 references
Summary: This paper deals with a generalization of the binary quasi-order theorem. This generalization involves a more complicated algorithm than in the previous papers [Publ., Secc. Mat., Univ. Autòn. Barc. 29, No.1, 31-64 (1985; Zbl 0583.51017); No.2/3, 123-144 (1985; see the preceding review)]. Some remarks are made on relative merits of two dual algorithms called the \(\psi\)-algorithm and the \(\phi\)-algorithm. Some illustrative examples are given.
0 references
quasi-order
0 references
algorithm
0 references
polygon
0 references
paper folding
0 references
0.88565433
0 references
0.87602174
0 references
0.86967516
0 references
0.86954856
0 references
0.8659673
0 references
0 references
