You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Linear time measure approximation of a set union given oracles for uniform sampling on the multiset union and membership testing on the insertion-order labeled set union.
measure: |S| e.g. volume, cardinality, ...
set union: U_i S_i
uniform sampling on the multiset union: Sample (y, k) from U_i { (x, i) : x in S_i } uniformly at random.
membership testing on the union-order labeled set union: Test whether (y, k) belongs to U_i { (x, i) : x in S_i, x not in S_j for j < i }. Can be implemented as testing whether y belongs to { x in S_k : x not in S_j for j < k } in general.
References
1983 Karp, Luby Monte-Carlo algorithms for enumeration and reliability problems
1989 Karp, Luby, Madras Monte-Carlo approximation algorithms for enumeration problems
The text was updated successfully, but these errors were encountered:
Linear time measure approximation of a set union given oracles for uniform sampling on the multiset union and membership testing on the insertion-order labeled set union.
measure:
|S|
e.g. volume, cardinality, ...set union:
U_i S_i
uniform sampling on the multiset union: Sample
(y, k)
fromU_i { (x, i) : x in S_i }
uniformly at random.membership testing on the union-order labeled set union: Test whether
(y, k)
belongs toU_i { (x, i) : x in S_i, x not in S_j for j < i }
. Can be implemented as testing whethery
belongs to{ x in S_k : x not in S_j for j < k }
in general.References
The text was updated successfully, but these errors were encountered: