The complexity of root-finding in orders

Pim Spelier

Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f\in \mathbb{Z}[X]$ has…