ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let O={1,S,+,∗}O=\{1,S,+,*\} and O∣={1,S,+,∗}O_{|}=\{1,S,+,*\} denote the two operation sets considered, and let cO(n)c_O(n) and cO∣(n)c_{O_{|}}(n) be their corresponding complexities.

Powers-of-three complexity conjecture. For every k∈Nk\in\mathbb N,

cO(3k)=4k−1.c_O(3^k)=4k-1.

Alternatively, for every k∈Nk\in\mathbb N,

cO∣(2k)=2k.c_{O_{|}}(2^k)=2k.

The source immediately notes that the lower-bound result implies this conjecture cannot hold simultaneously with the asymptotic complexity conjecture; accordingly, this candidate is refuted.

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.