๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Pyramidal structure of constructibility degrees

โœ Scribed by V. G. Kanovei; J. Zapletal

Publisher
SP MAIK Nauka/Interperiodica
Year
1998
Tongue
English
Weight
246 KB
Volume
63
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Algorithmic construction of Hamiltonians
Algorithmic construction of Hamiltonians in pyramids
โœ H. Sarbazi-Azad; M. Ould-Khaoua; L.M. Mackenzie ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 270 KB

The hierarchical nature and rich connectivity of the pyramid network have made it a desirable topology as both a hardware architecture and software structure to solve a number of important parallel applications, for example, in image processing and machine vision. Embedding of Hamiltonian path/cycle

A degree by degree recursive constructio
A degree by degree recursive construction of Hermite spline interpolants
โœ Xuli Han ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 853 KB

Based on the classical Hermite spline interpolant H 2n-1 , which is the piecewise interpolation polynomial of class C n-1 and degree 2n -1, a piecewise interpolation polynomial H 2n of degree 2n is given. The formulas for computing H 2n by H 2n-1 and computing H 2n+1 by H 2n are shown. Thus a simple

On the structure of subrecursive degrees
On the structure of subrecursive degrees
โœ Sanat K. Basu ๐Ÿ“‚ Article ๐Ÿ“… 1970 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 549 KB

Subrecursive degrees are partitions of computable (recursive) functions generated by strong reducibility orderings. Such reducibilities can be naturally characterized in terms of closure operations. Closure operations corresponding to standard reducibilities such as "primitive recursive," etc., are