Theoretical computer science · Oct 6, 2026
Deterministic polynomial factorization over prime fields
Gives a uniform deterministic algorithm that completely factors every nonzero dense degree-n polynomial over a prime field 𝔽p, including multiplicities, in bit complexity polynomial in . The prime is supplied in binary. No randomness, integer-factorization or primitive-root oracle, or GRH assumption is required.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model