Searching for "Complexity of Polynomial Multiplication over Finite Fields." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Multiplicative complexity of polynomial multiplication over finite fields
by Michael Kaminski, Nader H. Bshouty — 1987 — Proceedings 28th Annual Symposium on Foundations of Computer Science
…Multiplicative complexity of polynomial multiplication over finite fields* Michael Kaminski…
Cited by 6 (5 self) – Add To MetaCart

Multiplication of Polynomials Over Finite Fields
by Nader H. Bshouty, Michael Kaminski — 1990 — SIAM Journal on Computing
…Multiplication of polynomials over finite fields Nader H. Bshouty and Michael Kaminski Department…
Cited by 1 (1 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB