Sciweavers

1004 search results - page 18 / 201
» Product representations of polynomials
Sort
View
WINE
2010
Springer
135views Economy» more  WINE 2010»
14 years 7 months ago
Market Communication in Production Economies
We study the information content of equilibrium prices using the market communication model of Deng, Papadimitriou, and Safra [4]. We show that, in the worst case, communicating an...
Christopher A. Wilkens
DM
2007
98views more  DM 2007»
14 years 9 months ago
p-adic valuations and k-regular sequences
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
Jason P. Bell
ER
2001
Springer
111views Database» more  ER 2001»
15 years 2 months ago
Modeling Products for Versatile E-commerce Platforms - Essential Requirements and Generic Design Alternatives
Electronic commerce (e-commerce) covers a wide range of business transactions. Usually, a transactions includes products, i.e. goods or services. Often, e-commerce websites are int...
Ulrich Frank
CASC
2009
Springer
130views Mathematics» more  CASC 2009»
15 years 4 months ago
Code Generation for Polynomial Multiplication
We discuss the family of “divide-and-conquer” algorithms for polynomial multiplication, that generalize Karatsuba’s algorithm. We give explicit versions of transposed and sho...
Ling Ding, Éric Schost
CSR
2006
Springer
15 years 1 months ago
Complexity of Polynomial Multiplication over Finite Fields
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...
Michael Kaminski