SU\G(𝔸)/K·U

Computing values of a polynomial with only few multiplications

Darko Veljan

Type: Article

Publication Date: 1994-01-01

Citations: 0

DOI: https://doi.org/10.1016/0020-0190(94)90051-5

Locations

  • Information Processing Letters - View

Similar Works

Action Title Year Authors
+ Arithmetic sums of polynomial values 2016 В. Н. Чубариков
+ Sums of values of a polynomial multiplied by constants 1937 Kenneth S. Ghent
+ A lower bound for polynomial multiplication 1985 Michael Kaminski
+ A lower bound for polynomial multiplication 1985 Michael Kaminski
+ Finding the number of factors of a polynomial 1984 P. Weinberger
+ Classification of all the minimal bilinear algorithms for computing the coefficients of two polynomials modulo a polynomial (complexity, algebraic) 1984 Amir Averbuch
+ Computing With Polynomials: A Personal Odyssey 2002 Ruchira S. Datta
+ PDF Chat Computing Sparse Multiples of Polynomials 2010 Mark Giesbrecht
Daniel S. Roche
Hrushikesh Tilak
+ PDF Chat Computing Sparse Multiples of Polynomials 2012 Mark Giesbrecht
Daniel S. Roche
Hrushikesh Tilak
+ Solving Polynomials with Computers 1998 Victor Y. Pan
+ Solving Polynomials with Computers 1998 Victor Y. Pan
+ PDF Chat Reducing the number of variables of a polynomial 2006 Enrico Carlini
+ A Certified Program for the Karatsuba Method to Multiply Polynomials 2022 S. D. Meshveliani
+ Fast multiplication of small integers 2000 Jan‐Christoph Schlage‐Puchta
+ An algorithm for polynomial multiplication that does not depend on the ring constants 1988 Michael Kaminski
+ PDF Chat How many primes can divide the values of a polynomial? 2012 Florian Luca
Paul Pollack
+ Evaluation of High Degree Polynomials 2009 Michael-Ralf Skrzipek
+ PDF Chat Polynomials with many values in primes 1964 Vasilij Antonovič Golubev
+ 6 Arithmetic of Polynomials 2013
+ Multiplication and Division of Polynomials with Integer Coefficients 2024

Works That Cite This (0)

Action Title Year Authors

Works Cited by This (0)

Action Title Year Authors