Now showing items 1-6 of 6
Class number formulas via 2‐isogenies of elliptic curves
(Oxford University PressWiley Periodicals, Inc., 2012-12)
Random knapsacks with many constraints
(Elsevier, 1994-01-26)
We provide new results on asymptotic values for the random knapsack problem. For a very general model in which the parameters are determined by a rather arbitrary joint distribution, we compute the rate of growth as the ...
p-Tower Groups over Quadratic Imaginary Number Fields
(2008-10-01)
The modern theory of class field towers has its origins in the study of the p-class field tower over a quadratic imaginary number field, so it is fitting that this problem be the first in the discipline to be nearing a ...
Finite approximations to a zero-sum game with incomplete information
(Physica-Verlag; Springer Science+Business Media, 1990-03)
In this paper, we investigate a scheme for approximating a two-person zero-sum game G of incomplete information by means of a natural system G mn of its finite subgames. The main question is: For large m and n , is an ...
On the growth of random knapsacks
(Elsevier, 1990-09)
We consider the problem of optimally filling a knapsack of fixed capacity by choosing from among a collection of n objects of randomly determined weight and value. Under very mild conditions on the common joint distribution ...
Local limiting behavior of the zeros of approximating polynomials
(Elsevier, 1994-06)
Let f be a piecewise analytic (but not analytic) function in Ck[a, b], k [ges] 0, and let p*n be the sequence of polynomials of best uniform approximation to f on [a, b]. It is well known that every point of [a, b] is a ...