Sciweavers

1004 search results - page 48 / 201
» Product representations of polynomials
Sort
View
AAECC
2000
Springer
81views Algorithms» more  AAECC 2000»
15 years 18 days 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
75
Voted
ISSAC
2004
Springer
71views Mathematics» more  ISSAC 2004»
15 years 6 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
117
Voted
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 24 days 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 ...
120
Voted
ICIP
2006
IEEE
16 years 2 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
102
Voted
CORR
2000
Springer
81views Education» more  CORR 2000»
15 years 17 days 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