✦ LIBER ✦

On the maximal multiplicative complexity of a family of bilinear forms

✍ Scribed by M.D. Atkinson; N.M. Stephens

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 498 KB
Volume: 27
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(79)90026-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of computing bilinear

On the complexity of computing bilinear forms with {0, 1} constants

✍ Teofilo Gonzalez; Joseph Ja'Ja' 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 903 KB

On a Characterization of Bilinear Forms

On a Characterization of Bilinear Forms Graphs

✍ K. Metsch 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 165 KB

We show that the bilinear forms graphs H q (n, d) of diameter d ≥ 3 are characterized as distanceregular graphs by their parameters provided that either n ≥ d + 3 and q ≥ 3, or n ≥ d + 4 and q = 2. As a corollary of the method used, we can show the following. If is a distance-regular graph with clas

On the Algebra of Multiple Bilinear Tran

On the Algebra of Multiple Bilinear Transformations

✍ S. Erfani; M. Ahmadi; V. Ramachandran 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 304 KB

On the Complexity of Dualization of Mono

On the Complexity of Dualization of Monotone Disjunctive Normal Forms

✍ Michael L. Fredman; Leonid Khachiyan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 157 KB

We show that the duality of a pair of monotone disjunctive normal forms of size n can be tested in n oŽlog n. time.

On the intersection of families of maxim

On the intersection of families of maximal subgroups of a finite group

✍ A. Ballester-Bolinches 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 627 KB

A note on the descriptive complexity of

A note on the descriptive complexity of maximization problems

✍ Pierluigi Crescenzi; Riccardo Silvestri 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 375 KB