computational-algebra

computational-algebra copied to clipboard

- [ ] Force normal form and reduce `isZero` invocation - [ ] New list-based polynomial representation - [ ] New heap-based polynomial representation - [ ] Benchmarks

konn

Improve representation of monomials

2

Currently, monomials are represented as unboxed vectors of `Int`s. This seems rather inefficient: an unboxed vector stores an offset, a length, and the data is stored byte-per-byte instead of word-per-word....

sheaf

Solving quantified formulas (quantifier elimination)

1

It might be useful to extend the `computational-algebra` library to solve quantified formulas instead of quantifier-free formulas. I found [a Haskell library](https://github.com/QEPCAD-Haskell/QEPCAD-Haskell) that eliminates quantifiers formulas using cylindrical algebraic decomposition:...

jarble

Apologies if I've missed something, but I couldn't figure out how to use `solveM` or `solve'` with floating point coefficients (e.g. `Double`). Is this possible? In my situation, the algorithms...

sheaf

Succinct prime field representation for small `p`

3

Currently, a prime field `F p` is represented by `Integer`; but we can use `Int` instead for *small enough* prime `p`s. This branch implements a type-level hack to allow such...

konn

This branch and pull-request track the implementation and debugging of [M4GB] algorithm, which seems unworking in the current implementation. [M4GB]: https://dl.acm.org/doi/abs/10.1145/3087604.3087638

konn