Sciweavers

1004 search results - page 48 / 201
» Product representations of polynomials
Sort
View
AAECC
2000
Springer
81views Algorithms» more  AAECC 2000»
13 years 8 months ago
On Short Multiplications and Divisions
Computing only the low degree terms of the product of two univariate polynomials is called a short multiplication. By decomposition into subproblems, a short multiplication can be ...
Thom Mulders
ISSAC
2004
Springer
71views Mathematics» more  ISSAC 2004»
14 years 1 months ago
Sharp estimates for triangular sets
We study the triangular representation of zero-dimensional varieties defined over the rational field (resp. a rational function field). We prove polynomial bounds in terms of i...
Xavier Dahan, Éric Schost
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 8 months ago
Low Complexity Algorithms for Linear Recurrences
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
Alin Bostan, Frédéric Chyzak, Bruno ...
ICIP
2006
IEEE
14 years 10 months ago
Rendering Synthetic Objects in Natural Scenes
We present a method for solving the light integral problem for synthetic diffuse objects rendered within a natural scene. The approach generates realistic shading using only a few...
Mais Alnasser, Hassan Foroosh
CORR
2000
Springer
81views Education» more  CORR 2000»
13 years 8 months ago
Poly-locality in quantum computing
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
Michael H. Freedman