Set of O(nlog^2n) polynomial algorithms for working in non multiplicative subgroup
-
Notifications
You must be signed in to change notification settings - Fork 1
geometryxyz/fast-eval
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Set of O(nlog^2n) polynomial algorithms for working in non multiplicative subgroup
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published