The powers-of-three complexity conjecture
Statement
Let and denote the two operation sets considered, and let and be their corresponding complexities.
Powers-of-three complexity conjecture. For every ,
Alternatively, for every ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.