-
I have a system where the coefficients of the polynomials are huge integers. When declaring these polynomials, their coefficients are stored as `BigFloat`. When trying to solve the system, the package…
-
According to the thread starting [here](https://twitter.com/yezhang1998/status/1547068196783476736), this overhead is significant for large k.
We could either:
* try to reduce the degree of the po…
daira updated
1 month ago
-
Currently, I'm using Sage's `variety` method to solve systems of multivariate polynomials. However, the Singular backend is extremely slow in some [cases](https://priv.pub/posts/pbctf-2020/#special-gi…
-
Imported from SourceForge on 2024-07-05 16:39:49
Created by **[willisbl](https://sourceforge.net/u/willisbl/)** on 2011-06-03 10:51:01
Original: https://sourceforge.net/p/maxima/bugs/2200
---
\(%i1\…
rtoy updated
2 months ago
-
```
sage: set_random_seed(0)
sage: sr = m…
-
Maybe I don't understand it correctly, does the part of the code that uses the Virgo poly-commitment just commit to the input of the circuit? I don't see anything about the "zk-sumcheck" with mask-pol…
-
"Fast CRC Computation for Generic Polynomials Using PCLMULQDQ Instruction." [a la .NET 8.0](https://devblogs.microsoft.com/dotnet/performance-improvements-in-net-8/).
-
Thanks for this exciting package, which I am benchmarking against AMRVW.jl, Polynomials.jl, PolynomialRoots.jl, and my own companion matrix eigval implementation.
However, because your package choo…
-
The Mora algorithm in M2 is supposed to return a minimal Groebner/standard basis, but sometimes it doesn't. As an example:
```
R=QQ{x,y,z}
i=ideal"xyz+z5,2x2+y3+z7,3z5+y5"
transpose…
-
### Steps To Reproduce
Consider the code:
```
sage: R. = QQ[]
sage: x.parent()
Multivariate Polynomial Ring in x, y over Rational Field
sage: x.numerator()
x
sage: x.numerator().parent()
…