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

Algorithmic properties of structures

โœ Scribed by Erwin Engeler

Book ID
105283003
Publisher
Springer
Year
1967
Tongue
English
Weight
750 KB
Volume
1
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Algorithmic properties of free rings
Algorithmic properties of free rings
โœ G. V. Kryazhovskikh; G. P. Kukin ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› SP MAIK Nauka/Interperiodica ๐ŸŒ English โš– 959 KB
Algorithmic Properties of Polynomial Rin
Algorithmic Properties of Polynomial Rings
โœ M. KALKBRENER ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 935 KB

In this paper we investigate how algorithms for computing heights, radicals, unmixed and primary decompositions of ideals can be lifted from a Noetherian commutative ring R to polynomial rings over R.

An engineer's guide to algorithmic struc
An engineer's guide to algorithmic structures
โœ A.A. Kaposi ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 490 KB

This tutorial paper introduces the basic concepts of the theory of algorithms, defines regular algorithmic structures and illustrates some of the advantages of using such structures for the solution of engineering problems. Algorithms are instruments for solving problems by reasoning. The problems