✦ LIBER ✦

Complexity of computation in finite fields

✍ Scribed by Gashkov, S. B.; Sergeev, I. S.

Book ID: 120591367
Publisher: Springer US
Year: 2013
Tongue: English
Weight: 274 KB
Volume: 191
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-013-1350-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational Complexity of Checking Ide

Computational Complexity of Checking Identities in 0-Simple Semigroups and Matrix Semigroups over Finite Fields

✍ Steve Seif; Csaba Szabo 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 354 KB

Communication complexity of matrix compu

Communication complexity of matrix computation over finite fields

✍ J. I. Chu; G. Schnitger 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 764 KB

Computation with finite fields

✍ Thomas C. Bartee; David I. Schneider 📂 Article 📅 1963 🏛 Elsevier Science ⚖ 838 KB

Computational Complexity over Finite Fie

Computational Complexity over Finite Fields

✍ Strassen, Volker 📂 Article 📅 1976 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 682 KB

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

R64-49 Computation with Finite Fields

✍ Booth, T.L. 📂 Article 📅 1964 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 593 KB