The Homological Time Complexity Relation
Statement
Let be a computational problem, let denote its time complexity, and let denote its homological complexity. Homological Time Complexity Relation. There exists a polynomial such that, for every computational problem ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.