Open

Univariate Polynomial Factorization over Q (UPFQ)

Input

An $n^\text{th}$ degree polynomial $p \in \Q[x]$.

Problem

Compute the factorization of $p$ over $\Q$.

Status

Open (von zur Gathen [1]).

Remarks

UPFQ is $\NC^1$ reducible to SV [1].

References

  1. J. von zur Gathen (1984). Parallel algorithms for algebraic problems.
  2. Greenlaw, R., Hoover, H. J., and Ruzzo, W. L. (1995). Limits to Parallel Computation: P-Completeness Theory. Oxford University Press. Problem B.7.4.