✦ LIBER ✦

Some variants of the todd low-complexity algorithm

✍ Scribed by A. Liao

Publisher: Springer
Year: 1995
Tongue: English
Weight: 673 KB
Volume: 86
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf02193465

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Todd's low-complexity algorithm is a pre

Todd's low-complexity algorithm is a predictor-corrector path-following method

✍ M.J Todd; J.-P Vial 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 578 KB

Low Complexity Variants of the Arrow Dis

Low Complexity Variants of the Arrow Distributed Directory

✍ David Peleg; Eilon Reshef 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 134 KB

This paper considers an enhancement to the arrow distributed directory protocol, introduced in [8]. The arrow protocol implements a directory service, allowing nodes to locate mobile objects in a distributed system, while ensuring mutual exclusion in the presence of concurrent requests. The arrow pr

Some Variants of the Controlled Random S

Some Variants of the Controlled Random Search Algorithm for Global Optimization

✍ P. Kaelo; M. M. Ali 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 204 KB

The amortized complexity of Henriksen's

The amortized complexity of Henriksen's algorithm

✍ Jeffrey H. Kingston 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 312 KB

On the complexity of some algorithms of

On the complexity of some algorithms of matrix multiplication

✍ Valery B Alekseyev 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 712 KB

Barvinok's algorithm and the Todd class

Barvinok's algorithm and the Todd class of a toric variety

✍ James E. Pommersheim 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 882 KB

In this paper we prove that the Todd class of a simplicial toric variety has a canonical expression as a power series in the torus-invariant divisors. Given a resolution of singularities corresponding to a nonsingular subdivision of the fan, we give an explicit formula for this power series which yi