✦ LIBER ✦

An algorithm to compute the full set of many-to-many stable matchings

✍ Scribed by Ruth Martı́nez; Jordi Massó; Alejandro Neme; Jorge Oviedo

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 204 KB
Volume: 47
Category: Article
ISSN: 0165-4896
DOI: 10.1016/j.mathsocsci.2003.07.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm to compute the degree of ma

An algorithm to compute the degree of match in fuzzy systems

✍ Seongwon Cho; Okan K Ersoy; Mark Lehto 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 985 KB

An optimal algorithm to compute all the

An optimal algorithm to compute all the covers of a string

✍ Dennis Moore; W.F. Smyth 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 667 KB

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

A correction to “An optimal algorithm to

A correction to “An optimal algorithm to compute all the covers of a string”

✍ Dennis Moore; W.F. Smyth 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 265 KB

Matrix elements of many-particle-many-ho

Matrix elements of many-particle-many-hole states with an application to isospin mixing in the mass-17 system

✍ G.E. Walker; D. Schlobohm 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 953 KB

An Algorithm To Compute The Invariant Ri

An Algorithm To Compute The Invariant Ring Of A Ga-action On An Affine Variety

✍ Arno van den Essen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 159 KB

We describe an algorithm which computes the invariants of all \(G_{a}\)-actions on affine varieties, in case the invariant ring is finitely generated. The algorithm is based on a study of the kernel of a locally nilpotent derivation and some algoritlums from the theory of Gröbner bases.