✦ LIBER ✦

Minimal algorithms for bilinear forms may have divisions

✍ Scribed by Ephraim Feig

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 181 KB
Volume: 4
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(83)90036-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Certain systems of bilinear forms whose

Certain systems of bilinear forms whose minimal algorithms are all quadratic

✍ Ephraim Feig 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 628 KB

Minimal realizations and canonical forms

Minimal realizations and canonical forms for bilinear systems

✍ Hector J. Sussmann 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 908 KB

The minimal realization theory for input-output map8 that arise from finitedimensional, continuous time, bilinear systems is discussed. It is shown that an observed bilinear system (i.e. a bilinear system together with an observation functional, but without a Jixed initial state) is completely deter

On symmetric algorithms for bilinear for

On symmetric algorithms for bilinear forms over finite fields

✍ G Seroussi; A Lempel 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 886 KB

A nonquadratic minimal algorithm for a s

A nonquadratic minimal algorithm for a system of quadratic forms

✍ R Tolimieri 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 364 KB

An algorithm for finding all the points

An algorithm for finding all the points minimizing the sum of functions of a special form

✍ V.A. Borisov 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 236 KB

The best local algorithm for constructin

The best local algorithm for constructing the sum of minimal-essential disjunctive normal forms of a boolean function, using neighbourhoods of minimal order

✍ G.F. Losev 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 743 KB