𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The construction of ε-approximate algorithms for the optimization of functions in successively constructed sets

✍ Scribed by M.Ya. Kovalev; Ya.M. Shafranskii

Publisher
Elsevier Science
Year
1986
Weight
836 KB
Volume
26
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple algorithm for the construction
A simple algorithm for the construction of genealogical spin functions
✍ Ruben Pauncz 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 293 KB

## A sir& algorithm is given for the construction of spin eigenfunctions accordin, 0 to the genealogiical scheme. The method can deal.dtiectly with the N.electron problem without any knowledge of the (?J-l)-elecLron spin eigenfunctions. It uses the representation matrices corresponding to the tran

An Optimal Algorithm for Constructing th
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals
✍ Ulla Koppenhagen; Ernst W. Mayr 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 642 KB

In this paper, we present an optimal, exponential space algorithm for generating the reduced Gröbner basis of binomial ideals. We make use of the close relationship between commutative semigroups and pure difference binomial ideals. Based on an optimal algorithm for the uniform word problem in commu