Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Chernoff test #129

Open
johnynek opened this issue Feb 25, 2013 · 0 comments
Open

Chernoff test #129

johnynek opened this issue Feb 25, 2013 · 0 comments
Labels
algorithm testing

Comments

@johnynek
Copy link
Collaborator

johnynek commented Feb 25, 2013 •
edited by sritchie
Loading

We should write some reusable code in algebird-test to have a scalacheck property that is true with probability at least P. Then, using the chernoff bound, we should verify that this claim is true with a very high probability (something like p=10^{-9}), so that the tests will almost always pass.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
algorithm testing
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@johnynek @sritchie