← All problems

Harvey–Hittmeir question on deterministic integer-root finding

This entry tracks Harvey–Hittmeir question on deterministic integer-root finding.

The conditional result reaches input-size complexity up to logarithmic factors, with an unconditional small-height regime.

Latest development

The previous roughly n^{3/2}b deterministic bound is reduced to \widetilde Onbnb conditionally on Pan’s theorem, with unconditional \widetilde Onb+min⁡(n,b)3b2nb+\min(n,b)^3b^2.

Editorial caveat

The general quasilinear bound depends on an unverified part of Pan’s approximate-factorization analysis.

References

Source: arXiv

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.