-
## Enhancement idea
- [x] Add Feature: Polynomial Algorithm.
- [x] Connect to Alerts Modules and add custom alerts, see here: https://github.com/chartingshow/documentation/issues/70
- [x] Connect…
-
Imported from SourceForge on 2024-07-04 09:54:22
Created by **[mgerbershagen](https://sourceforge.net/u/mgerbershagen/)** on 2021-08-21 12:55:40
Original: https://sourceforge.net/p/maxima/bugs/3832
-…
rtoy updated
4 months ago
-
Hi, I am a student working on permanent computation. I would like to ask if this program can be used to compute the permanent of a matrix of order 60? If it can be computed, is the computation done in…
-
The current [polynomial multiplication](https://github.com/Axect/Peroxide/blob/04e777f7feedd55c343801d7c508ec49f0b86947/src/structure/polynomial.rs#L341) has a runtime of O(n^2). This is fine for some…
-
Based on discussions with @mezzarobba and @fredrik-johansson:
- [ ] A module for generic Ore polynomials: `gr_ore_poly`
- [ ] differential operators in `d/dz` and in `z*d/dz`, with `gr_poly`s as…
-
See https://andrescaicedo.wordpress.com/2008/11/11/275-positive-polynomials/ for mathematical details, and http://www.mathcs.emory.edu/~vicki/pub/sos.pdf for the algorithm. Also https://en.wikipedia.o…
-
### Detailed description
Pollard’s Rho Algorithm is an efficient method for integer factorization, particularly effective for finding small non-trivial factors of large composite numbers. Developed…
-
Consider the following code, which calculates the roots of the polynomial `x^4` using the companion matrix eigenvalues:
```c#
var polynomial = new Polynomial(0, 0, 0, 0, 1);
var rootsReal = polynom…
-
## Enhancement idea
- [x] Add Feature: Crypto Market Algorithm.
- [x] Light and dark modes.
- [x] Add to Themes, see here: https://github.com/chartingshow/documentation/issues/194
- [x] Enhance …
-
## Problem
Given integer sequences $A_0, ..., A_{N - 1}, B_0, ..., B_{N - 1}$, initial state $f_0, ..., f_{M - 1}$ and transition polynomial $g_0, ..., g_{K - 1}$, count the sum of weight over all …