language-icon Old Web
English
Sign In

The Power of an Example

2016 
We study a basic problem of approximating the size of an unknown set S in a known universe U. We consider two versions of the problem. In both versions, the algorithm can specify subsets TU. In the...
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []