✦ LIBER ✦

On the complexity of recognizing a class of generalized networks

✍ Scribed by Vijaya Chandru; Collette R Coullard; Donald K Wagner

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 298 KB
Volume: 4
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(85)90036-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of recognizing tough g

On the complexity of recognizing tough graphs

✍ Douglas Bauer; Aurora Morgana; Edward Schmeichel 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 252 KB

On the complexity of recognizing perfect

On the complexity of recognizing perfectly orderable graphs

✍ Matthias Middendorf; Frank Pfeiffer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 365 KB

On the Complexity of Recognizing Hamming

On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs

✍ Wilfried Imrich; Sandi Klavzar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 287 KB

On a class of nonlinear networks

✍ T. Matsumoto 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 785 KB

On the design of a class of neural netwo

On the design of a class of neural networks

✍ David V. Sánchez A. 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 196 KB

The design of the class of RBF networks is described. These three-layer networks possess the universal and best approximation capability in the framework of supervised learning of real functions of real vectors from examples and offer a large amount of applications. A learning method is described fo

On a Class of Generalized Nilpotent Grou

On a Class of Generalized Nilpotent Groups

✍ A. Ballester-Bolinches; Tatiana Pedraza 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 103 KB

We explore the class of generalized nilpotent groups in the universe c of all radical locally finite groups satisfying min-p for every prime p. We obtain that this class is the natural generalization of the class of finite nilpotent groups from the finite universe to the universe c . Moreover, the s