samplable

That may be sampled

Wikipedia foundation.

Look at other dictionaries:

  • Average-case complexity — For deterministic algorithms, the average case complexity (expected time complexity), associates a given input distribution with the expected time of an algorithm.Leonid Levin presented the motivation for studying average case complexity as… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.