1418 search results - page 48 / 284 » Schema polynomials and applications |
129
click to vote
DAM
2006
15 years 4 months ago
2006
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
132
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two pol...
178
click to vote
LPNMR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The paper presents INFOMIX a successful application of ASP technology to the domain of Data Integration. INFOMIX is a novel system which supports powerful information int...
100
click to vote
RC
1998
15 years 4 months ago
1998
Numerical interpolation and approximation are powerful tools to solve real world application problems. To take data measurement errors into considerations of interpolating a d deg...
138
click to vote
CARDIS
2010
Springer
15 years 11 months ago
2010
Springer
![The Polynomial Composition Problem in (Z/nZ)[X]](https://sciweavers.org/files/imagecache/thumbnail/default/content.jpg "The Polynomial Composition Problem in (Z/nZ)[X]")
Let n be an RSA modulus and let P, Q ∈ (Z/nZ)[X]. This paper explores the following problem: Given polynomials Q and Q(P), find polynomial P. We shed light on the connections be...