𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A lower bound for the memory capacity in the Potts-Hopfield model

✍ Scribed by Pablo A. Ferrari; Servet Martínez; Pierre Picco

Publisher
Springer
Year
1992
Tongue
English
Weight
349 KB
Volume
66
Category
Article
ISSN
0022-4715

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower Bounds for the Complexity of Funct
Lower Bounds for the Complexity of Functions in a Realistic RAM Model
✍ Nader H. Bshouty 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 127 KB

This paper develops a new technique that finds almost tight lower bounds for the complexity of programs that compute or approximate functions in a realistic RAM model. The nonuniform realistic RAM model is a model that uses the arithmetic Ä 4 operations q, y, = , the standard bit operation Shift, Ro

A Lower Bound for the Height in Abelian
A Lower Bound for the Height in Abelian Extensions
✍ Francesco Amoroso; Roberto Dvornicich 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 172 KB

We produce an absolute lower bound for the height of the algebraic numbers (different from zero and from the roots of unity) lying in an abelian extension of the rationals. The proof rests on elementary congruences in cyclotomic fields and on Kronecker Weber theorem.