An exponent one-fifth algorithm for deterministic integer factorisation

by   David Harvey, et al.

Hittmeir recently presented a deterministic algorithm that provably computes the prime factorisation of a positive integer N in N^2/9+o(1) bit operations. Prior to this breakthrough, the best known complexity bound for this problem was N^1/4+o(1), a result going back to the 1970s. In this paper we push Hittmeir's techniques further, obtaining a rigorous, deterministic factoring algorithm with complexity N^1/5+o(1).


page 1

page 2

page 3

page 4


Faster integer and polynomial multiplication using cyclotomic coefficient rings

We present an algorithm that computes the product of two n-bit integers ...

Deterministic factoring with oracles

We revisit the problem of integer factorization with number-theoretic or...

Randomized Polynomial-Time Root Counting in Prime Power Rings

Suppose k,p∈N with p prime and f∈Z[x] is a univariate polynomial with de...

Faster deterministic parameterized algorithm for k-Path

In the k-Path problem, the input is a directed graph G and an integer k≥...

Fractal surfaces from simple arithmetic operations

Fractal surfaces ('patchwork quilts') are shown to arise under most gene...

Deterministic computation of the characteristic polynomial in the time of matrix multiplication

This paper describes an algorithm which computes the characteristic poly...

Computational Hardness and Fast Algorithm for Fixed-Support Wasserstein Barycenter

We study in this paper the fixed-support Wasserstein barycenter problem ...

Please sign up or login with your details

Forgot password? Click here to reset