✦ LIBER ✦

Construction of an effective algorithm to find the isomorphism of two simple finite semigroups

✍ Scribed by V. A. Makarenko

Book ID: 105056739
Publisher: Springer US
Year: 1987
Tongue: English
Weight: 708 KB
Volume: 22
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01068686

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of an adaptive algorithm to fin

Analysis of an adaptive algorithm to find the two nearest neighbors

✍ P. V. Poblete 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 411 KB

Algorithm for constructing automorphisms

Algorithm for constructing automorphisms on an electronic computer and for answering the question of the isomorphism of finite groups

✍ Yu. P. Vasil'ev 📂 Article 📅 1978 🏛 Springer US 🌐 English ⚖ 293 KB

An approach to the question of construct

An approach to the question of constructing effective recognition algorithms

✍ A.A. Aleksanyan; Yu.I. Zhuravlev 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 549 KB

An algorithm to construct the basis of t

An algorithm to construct the basis of the intersection of finitely generated free groups

✍ S. L. Krivoi 📂 Article 📅 1983 🏛 Springer US 🌐 English ⚖ 779 KB

An Optimal Algorithm for Constructing th

An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals, and Applications to Commutative Semigroups

✍ Ulla Koppenhagen; Ernst W. Mayr 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 404 KB

It is known that the reduced Gröbner basis of general polynomial ideals can be computed in exponential space. The algorithm, obtained by Kühnle and Mayr, is, however, based on rather complex parallel computations, and, above that, makes extensive use of the parallel computation thesis. In this paper

Multiple Regression as a Method of Const

Multiple Regression as a Method of Construction of Isolines of Animal Response to a Joint Effect of Two Factors (Using the Vocal Activity of the Steppe Marmot as an Example)

✍ A. A. Nikol'skii; A. T. Terekhin 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 79 KB