696 search results - page 76 / 140 » A class of combinatorial identities |
175
click to vote
STACS
2007
Springer
16 years 12 days ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
161
click to vote
FOCS
2005
IEEE
15 years 12 months ago
2005
IEEE
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
151
click to vote
BIRTHDAY
2005
Springer
15 years 12 months ago
2005
Springer
Huet and L´evy (1979) showed that needed reduction is a normalizing strategy for orthogonal (i.e., left-linear and non-overlapping) term rewriting systems. In order to obtain a de...
162
click to vote
FSE
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we study the minimum distance between the set of bent functions and the set of 1-resilient Boolean functions and present a lower bound on that. The bound is proved to...
221
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...