ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let LL be a computational problem, let TL(n)T_L(n) denote its time complexity, and let h(L)h(L) denote its homological complexity. Homological Time Complexity Relation. There exists a polynomial pp such that, for every computational problem LL,

TL(n)=Ω(2h(L)⋅log⁡n).T_L(n)=\Omega\left(2^{h(L)\cdot\log n}\right).

Thus homological complexity is conjectured to provide an exponential lower bound on time complexity. The source gives no resolution or supporting result sufficient to establish this relation, so its status remains open.

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.