✦ LIBER ✦

Computational Complexity over Finite Fields

✍ Scribed by Strassen, Volker

Book ID: 118178083
Publisher: Society for Industrial and Applied Mathematics
Year: 1976
Tongue: English
Weight: 682 KB
Volume: 5
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0205027

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Communication complexity of matrix compu

Communication complexity of matrix computation over finite fields

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

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

Computational complexity of sentences ov

Computational complexity of sentences over fields

✍ Shih Ping Tung 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 260 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

The complexity of sparse polynomial inte

The complexity of sparse polynomial interpolation over finite fields

✍ Kai Werther 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 650 KB

On the deterministic complexity of facto

On the deterministic complexity of factoring polynomials over finite fields

✍ Victor Shoup 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 792 KB