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

performance of the brute-force (splitwise) succ/predecessors vs prime (primewise?) successors #15

Open

chudicek opened this issue Nov 28, 2023 · 0 comments

Contributor

chudicek commented Nov 28, 2023

working with the presumption that primewise successors should be more efficient. no proof so far tho.

benchmark needed

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment