467 search results - page 31 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
WCC
2005
Springer
15 years 5 months ago
2005
Springer
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
ICCAD
2004
IEEE
15 years 8 months ago
2004
IEEE
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
CASC
2010
Springer
14 years 10 months ago
2010
Springer
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
ICIP
2005
IEEE
16 years 1 months ago
2005
IEEE
In this paper, we propose new sampling schemes for classes of 2-D signals with finite rate of innovation (FRI). In particular, we consider sets of 2-D Diracs and bilevel polygons....
106
click to vote
FOCS
2008
IEEE
14 years 12 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...