-
Vizing's theorem states that any simple graph's edges [can be coloured](https://en.wikipedia.org/wiki/Edge_coloring) with either `Delta` or `Delta + 1` colours, where `Delta` is the maximum degree.
…
-
https://github.com/ARM-software/optimized-routines/tree/master/math/aarch64 implements some math operations with neon simd instructions. The perf looks good, especially for exp(). I'm wondering if it'…
-
We know from theory that finding a single max likelihood flow is a mcf problem and thus polynomial.
Thus the argument in a completly static network (where noone but us makes a payment) would probab…
-
Given a polynomial from ℚ[X], we need a better way to express its roots using radical expressions if such an expression is possible.
The current approach, as used by e.g. `NumberFieldElement._symbo…
-
Occuring when the routine deals with the continuum analysis:
```
--OBS_DIR: /data/spirou4/apero-data/offline/red/23BQ01-Aug09
19:04:20.672-**|POLAR[11892]| --EXPOSURES[0]: [TELLU_OBJ] 2890757o…
-
The goal of this ticket is to implement the algorithm in arXiv:2006.00657 to compute the chromatic quasisymmetric function and unicellular LLT polynomials of indifference graphs.
A prototype can b…
-
`You can see that, in a distributed system, the cost of sorting results grows *exponentially* the deeper we page.`
It doesn't grow exponentially -- the growth function is still polynomial (what exact…
-
Is there currently an algorithm for the detection of comparability graphs - sometimes known as transitively orientable graphs - [https://en.wikipedia.org/wiki/Comparability_graph](url) or algorithms …
-
Imported from SourceForge on 2024-07-09 11:20:50
Created by **[rayon340](https://sourceforge.net/u/rayon340/)** on 2023-12-28 17:10:23
Original: https://sourceforge.net/p/maxima/bugs/4231
---
Dear e…
rtoy updated
2 months ago
-
In sage 6.0, dense polynomials over Z/nZ with n composite raise an AttributeError about missing attribute xgcd when inverse_mod is called. Here is an example:
```
sage: K. = PolynomialRing(IntegerM…