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

Algorithms for multiplication #28

Open
dpsanders opened this issue Mar 11, 2020 · 0 comments
Open

Algorithms for multiplication #28

dpsanders opened this issue Mar 11, 2020 · 0 comments

Comments

@dpsanders
Copy link
Member

There are various algorithms for multiplication of two affine forms.
Currently we are using one that is O(n^2), where n is the length of the vectors in the affine expression, but presumably gives more accurate answers.

However there should be a mechanism to choose a more efficient one (O(n)).
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@dpsanders