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

Analysis: arithmetic multiplication #31

Open
DavidLeoni opened this issue Jul 23, 2022 · 0 comments
Open

Analysis: arithmetic multiplication #31

DavidLeoni opened this issue Jul 23, 2022 · 0 comments
Labels
enhancement New feature or request

Comments

@DavidLeoni
Copy link
Owner

DavidLeoni commented Jul 23, 2022 •
edited
Loading

Currently in analysis page there are some integer multiplications by constant two: I considered them as $O(1)$ as small ints in CPUs would actually require just a bit shift, but after some research I fear in Python they are still really slow $O(k^2)$ with $k$ bits

Alas with multiplication there are to many levels of abstraction: theoretical (for single core), parallel implementation in actual CPU for small ints, implementation in Python... To avoid confusion I think it would be better to just get rid of multiplications and substitute with sums (when it makes sense).
@DavidLeoni DavidLeoni added the enhancement New feature or request label Jul 23, 2022
@DavidLeoni DavidLeoni changed the title Analysis: multiplication by constants vs variable Analysis: arithmetic multiplication Jul 23, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@DavidLeoni