-
Hi,
Does Flint have multi-point evaluation of multivariate polynomials at geometric sequences over finite fields ?
For example, something like the matrix-vector product with a transposed Vander…
-
Hi Jonathan:
It has been a long time since the last question. I have got a problem recently. When there are only enough data for the input variables (more than 1 dimension), how can I compute the …
-
Save polynomials as linked lists with the coefficients as the values of each term, in descending order of power of x, and the degree of the polynomial being the number of terms - 1
(a degree 0 polyn…
-
decide on an interface to completions (padic, qadic, Avi, SeriesElem, Hamburger-Noether, ...)
- setprecision set_precision (inplace and not) (for elements)
- lift, rational_reconstruct
- map_coeff…
-
Now we calculate the derivatives and polynomials and construct the library in the same function. If we decouple this we can more easily use the library function outside of deepmod, i.e. to compare to …
-
-
I found this while looking at #15408.
The shorthand `Poly(expr)` for `Poly(expr, x)` should guess the polynomial variate from the expression `expr`. However it fails if the polynomial has a coeffic…
-
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…
-
### Is there an existing issue for this?
- [X] I have searched the existing issues for a bug report that matches the one I want to file, without success.
### Problem Description
The variables…
-
The actual encryption function should multiply the polynomials, but seems the code is performing coefficient-wise multiply
https://github.com/chiraag/gazelle_mpc/blob/f4eb3bae09bf4897f2651946eac7de…