36781 search results - page 201 / 7357 » Parameterizing by the Number of Numbers |
92
Voted
MYCRYPT
2005
Springer
15 years 6 months ago
2005
Springer
In this paper we produce a practical and efficient algorithm to find a decomposition of type n = k i=1 2si 3ti , si, ti ∈ N ∪ {0} with k ≤ c + o(1) ¡ log n log log n ....
84
Voted
SAT
2005
Springer
15 years 6 months ago
2005
Springer
We present an algorithm that decides the satisfiability of a
105
click to vote
UM
2005
Springer
15 years 6 months ago
2005
Springer
This paper is concerned with user modelling issues such as adaptive educational environments, adaptive information retrieval, and support for collaboration. The HomeWork project is...
90
Voted
COMPGEOM
2004
ACM
15 years 6 months ago
2004
ACM
Let P be a set of n points in Ê3 , not all in a common plane. We solve a problem of Scott (1970) by showing that the connecting lines of P assume at least 2n − 7 different dir...
SPAA
2004
ACM
15 years 6 months ago
2004
ACM