166 search results - page 5 / 34 » Resultants of partially composed polynomials |
CRYPTO
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. In 1998, Boneh, Durfee and Frankel [4] presented several attacks on RSA when an adversary knows a fraction of the secret key bits. The motivation for these so-called part...
EUROCRYPT
2010
Springer
15 years 2 months ago
2010
Springer
A seminal result of Cleve (STOC ’86) is that, in general, complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
119
click to vote
CDC
2010
IEEE
14 years 1 months ago
2010
IEEE
— The problem of placing an arbitrary subset (m) of the (n) closed loop eigenvalues of a nth order continuous time single input linear time invariant(LTI) system, using full stat...
CSDA
2010
14 years 9 months ago
2010
In this paper, we specify the indirect utility function as a partially linear model, where utility is nonparametric in expenditure and parametric (with fixed- or varying-coefficie...