✦ LIBER ✦

A polynomial time algorithm to compute the Abelian kernel of a finite monoid

✍ Scribed by Manuel Delgado; Pierre-Cyrille Héam

Publisher: Springer
Year: 2003
Tongue: English
Weight: 170 KB
Volume: 67
Category: Article
ISSN: 0037-1912
DOI: 10.1007/s00233-002-0004-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Algorithm to Compute the Kernel of a

An Algorithm to Compute the Kernel of a Derivation up to a Certain Degree

✍ Stefan Maubach 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 303 KB

Algorithm to compute the maximal abelian

Algorithm to compute the maximal abelian dimension of Lie algebras

✍ M. Ceballos; J. Núñez; A. F. Tenorio 📂 Article 📅 2009 🏛 Springer Vienna 🌐 English ⚖ 242 KB

A fast algorithm to compute irreducible

A fast algorithm to compute irreducible and primitive polynomials in finite fields

✍ J. Rifà; J. Borrell 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 364 KB

A polynomial-time algorithm for linear o

A polynomial-time algorithm for linear optimization based on a new class of kernel functions

✍ M. El Ghami; I. Ivanov; J.B.M. Melissen; C. Roos; T. Steihaug 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 721 KB

A polynomial time algorithm to detect PQ

A polynomial time algorithm to detect PQI interval orders

✍ An Ngo The; Alexis Tsoukiàs; Philippe Vincke 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB

An algorithm to compute the set of chara

An algorithm to compute the set of characteristics of a system of polynomial equations over the integers

✍ Rosemary Baines; Peter Vámos 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 135 KB

We describe a (finite) algorithm to determine the set of characteristics of a system of polynomial equations with integer coefficients by using the theory of Gröbner bases. This gives us a proof that the set of characteristics must be either finite and not containing zero, or containing zero and cof