Sciweavers

36781 search results - page 136 / 7357
» Parameterizing by the Number of Numbers
Sort
View
CRYPTO
2009
Springer
82views Cryptology» more  CRYPTO 2009»
14 years 5 months ago
Solving Hidden Number Problem with One Bit Oracle and Advice
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 ...
Adi Akavia
COMPGEOM
2009
ACM
14 years 5 months ago
An improved bound on the number of unit area triangles
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...
Roel Apfelbaum, Micha Sharir
SYNASC
2007
IEEE
105views Algorithms» more  SYNASC 2007»
14 years 4 months ago
Decompositions of Natural Numbers: From a Case Study in Mathematical Theory Exploration
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...
Adrian Craciun, Madalina Hodorog
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
14 years 4 months ago
Maximizing the Number of Independent Labels in the Plane
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 ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee
ICALP
2007
Springer
14 years 4 months ago
On the Chromatic Number of Random Graphs
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 χ...
Amin Coja-Oghlan, Konstantinos Panagiotou, Angelik...