7796 search results - page 235 / 1560 » On Generalized Schur Numbers |
165
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We consider the tile self-assembly model and how tile complexity can be eliminated by permitting the temperature of the self-assembly system to be adjusted throughout the assembly...
159
click to vote
DM
2006
15 years 6 months ago
2006
For an oriented graph G with n vertices, let f(G) denote the minimum number of transitive subtournaments that decompose G. We prove several results on f(G). In particular, if G is...
168
click to vote
DM
2006
15 years 6 months ago
2006
For n, k and t such that 1 < t < k < n, a set F of subsets of [n] has the (k, t)threshold property if every k-subset of [n] contains at least t sets from F and every (k -...
142
click to vote
FOCM
2006
15 years 6 months ago
2006
The main result of this paper is a new version of Newton-Hensel lifting that relates to interpolation questions. It allows one to lift polynomials in Z[x] from information modulo a...
166
click to vote
COMCOM
2007
15 years 6 months ago
2007
The difficulty of efficiently reordering the rules in an Access Control List is considered and the essential optimisation problem formulated. The complexity of exact and sophistic...