COCO
2003
Springer
14 years 5 months ago
2003
Springer
We extract a paradigm for derandomizing tests for polynomial identities from the recent AKS primality testing algorithm. We then discuss its possible application to other tests.
COCO
2009
Springer
14 years 7 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...