5
votes
Accepted
Complexity record for solving univariate quadratic equation over finite field
The standard algorithm for factoring univariate polynomials over finite fields is the Cantor–Zassenhaus algorithm. This is a randomized algorithm that can factor degree-$d$ polynomials over $\mathbb ...
- 4,314
2
votes
Accepted
Stateless Modeling of Stochastic Systems
One can implement a function $f:S \times \{0,1,\dots,2^m-1\} \to \mathbb{Z}$ that has approximately the right distribution, and so that $f(\text{seed},t)$ can be computed in something like $O(m)$ time....
D.W.♦
- 169k
Only top scored, non community-wiki answers of a minimum length are eligible