1089 search results - page 40 / 218 » Bounds on generalized Frobenius numbers |
136
click to vote
ISSAC
2007
Springer
16 years 7 days ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
180
Voted
WDAG
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
154
click to vote
IWANN
2009
Springer
15 years 10 months ago
2009
Springer
We propose a general method for estimating the distance between a compact subspace K of the space L1 ([0, 1]s ) of Lebesgue measurable functions defined on the hypercube [0, 1]s ,...
171
click to vote
CRYPTO
2000
Springer
15 years 10 months ago
2000
Springer
In this paper we investigate the relationship between the nonlinearity and the order of resiliency of a Boolean function. We first prove a sharper version of McEliece theorem for ...
163
click to vote
UAI
2003
15 years 7 months ago
2003
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...