36781 search results - page 136 / 7357 » Parameterizing by the Number of Numbers |
105
click to vote
CRYPTO
2009
Springer
15 years 10 months ago
2009
Springer
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
114
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We show that the number of unit-area triangles determined by a set of n points in the plane is O(n9/4+ε), for any ε > 0, improving the recent bound O(n44/19) of Dumitrescu et...
121
click to vote
SYNASC
2007
IEEE
15 years 10 months ago
2007
IEEE
In this technical report we present the proofs of properties appearing when solving the problem of prime decomposition of natural numbers using a scheme-based systematic exploratio...
125
click to vote
FAW
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
114
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we consider the classical Erd˝os-R´enyi model of random graphs Gn,p. We show that for p = p(n) ≤ n−3/4−δ , for any fixed δ > 0, the chromatic number χ...