๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Communication complexity of matrix computation over finite fields

โœ Scribed by J. I. Chu; G. Schnitger

Publisher
Springer
Year
1995
Tongue
English
Weight
764 KB
Volume
28
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Idempotent Computation over Finite Field
Idempotent Computation over Finite Fields
โœ Richard A. Davis ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 738 KB

In this paper, we provide an account of several new techniques for computing the primitive idempotents of a commutative artinian algebra over a finite field. Examples of such algebras include the center of a finite group algebra or any finite dimensional quotient of a polynomial ring. The computatio

The communication complexity of several
The communication complexity of several problems in matrix computation
โœ Jeff I Chu; Georg Schnitger ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 747 KB

The communication complexity of a function f measures the communication resources required for computingf. In the design of VLSI systems, where savings on the chip area and computation time are desired, this complexity dictates an area x time\* lower bound. We investigate the communication complexit

The computer construction of matrix repr
The computer construction of matrix representationsof finite groups over finite fields
โœ R.A. Parker; R.A. Wilson ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 517 KB

Given an abstract group G it is important to be able to find explicit generators for a concrete group isomorphic to G, in order to perform calculations with the group. In this paper we describe a method of using the "Meat-axe" to construct explicit matrix generators for a given group.