ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let M(n)M(n) denote the time complexity of multiplying two nn-bit integers. The self-correcting algorithm described in the paper computes pipi with error O(2−n)O(2^{-n}).

Fast self-correcting pipi algorithm conjecture. Algorithm~ runs in O(M(n)log⁡n)O(M(n)\log n) bit operations.

The algorithm is already proved to run in O(M(n)log⁡2n)O(M(n)\log^2 n) bit operations and is self-correcting, producing a more accurate approximation from an approximate input with cubic convergence. The conjecture asserts the sharper complexity matching the known asymptotically fastest algorithms for computing pipi; no resolution is supplied in the source.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.