51 search results - page 1 / 11 » Space- and time-efficient polynomial multiplication |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
JAT
2008
13 years 7 months ago
2008
In this paper we give a simple characterization of weighted Sobolev spaces (with piecewise monotonous weights) such that the multiplication operator is bounded: it is bounded if an...
ISSAC
2005
Springer
14 years 29 days ago
2005
Springer
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
CRYPTO
1991
Springer
13 years 11 months ago
1991
Springer
Recent results in interactive proof systems [?][?] [?] seem to indicate that it is easier for a prover in a single prover interactive proof system to cheat the verifier than it i...