✦ LIBER ✦

A lower bound for polynomial multiplication

✍ Scribed by Michael Kaminski

Book ID: 107948546
Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 197 KB
Volume: 40
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90174-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound for the multiplication of

A lower bound for the multiplication of polynomials modulo a polynomial

✍ Nader H. Bshouty 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 415 KB

A Lower Bound on the Complexity of Polyn

A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields

✍ Kaminski, Michael 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 338 KB

A Lower Bound for Matrix Multiplication

✍ Bshouty, Nader H. 📂 Article 📅 1989 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 499 KB

On lower bounds for the complexity of po

On lower bounds for the complexity of polynomials and their multiples

✍ W. Baur; K. Halupczok 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 207 KB

Lower bounds for the polynomial calculus

✍ A.A. Razborov 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 523 KB

Lower bounds and upper bounds for chroma

Lower bounds and upper bounds for chromatic polynomials

✍ Klaus Dohmen 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

## Abstract In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on __n__ vertices having __m__ edges and girth exceeding __g__ © 1993 John Wiley & Sons, Inc.