9611 search results - page 5 / 1923 » A Note on Difference Sets |
LOGCOM
2010
13 years 5 months ago
2010
This paper has two purposes. The first is to present a final coalgebra construction for finitary endofunctors on Set that uses a certain subset L∗ of the limit L of the firs...
JDA
2006
13 years 7 months ago
2006
The currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n nodes is the trivial (2n) algorithm which enumerates and checks all the subsets of
DM
2006
13 years 7 months ago
2006
We answer a question raised by Brass on the number of maximally repeated sub-patterns in a set of n points in Rd. We show that this number, which was conjectured to be polynomial,...
SNSC
2001
Springer
13 years 12 months ago
2001
Springer
SNSC
2001
Springer
13 years 12 months ago
2001
Springer
