1089 search results - page 55 / 218 » Bounds on generalized Frobenius numbers |
JCO
2008
13 years 7 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
DCC
2000
IEEE
13 years 7 months ago
2000
IEEE
Due to the success of differential and linear attacks on a large number of encryption algorithms, it is importanttoinvestigaterelationshipsamongvariouscryptographic, includingdiffe...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of term rewrite systems. In particular, triangular matrix interpretations over the natural numbers are known...
COMGEO
2007
ACM
13 years 7 months ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
COMBINATORICS
2004
13 years 7 months ago
2004
We consider Class-Uniformly Resolvable Group Divisible Designs (CURGDD), which are resolvable group divisible designs in which each of the resolution classes has the same number o...