10 search results - page 2 / 2 » Infinite computable version of Lovasz Local Lemma |
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
JAPLL
2010
13 years 3 months ago
2010
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...
GG
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Adhesive high-level replacement (HLR) categories and systems are introduced as a new categorical framework for graph transformation in a broad sense, which combines the w...
GG
2004
Springer
13 years 10 months ago
2004
Springer
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no ade...
SIAMCOMP
2010
13 years 3 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...