The precise homological complexity characterization of complexity classes
Statement
Let be a natural complexity class, let denote the homological complexity of the restriction of a problem to inputs of size , and let . Precise homological complexity characterization. For every natural complexity class , there exists a function such that
This conjectures a size-sensitive homological characterization of every natural complexity class. The source presents it as a future research direction and gives no proof or resolution.
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.