36781 search results - page 333 / 7357 » Parameterizing by the Number of Numbers |
183
click to vote
COMBINATORICA
2008
15 years 6 months ago
2008
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
181
click to vote
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
Abstract In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if th...
163
click to vote
CSL
1992
Springer
15 years 11 months ago
1992
Springer
ating Point Numbers (Abstract). In: Berichte aus Informatik
122
Voted
EUROCRYPT
1989
Springer
15 years 11 months ago
1989
Springer
We makean attemptto compare the speed of eemeprimalitytestingalgorithmsfor certifying loo-digit prime numbers.
201
click to vote
TYPES
2000
Springer
15 years 11 months ago
2000
Springer
We describe a construction of the real numbers carried out in the Coq proof assistant. The basis is a set of axioms for the constructive real numbers as used in the FTA (Fundamenta...