The ultimate homological characterization of complexity classes
Statement
Let be a natural complexity class, let denote the homological complexity of a problem , and let be a subset of . Ultimate homological characterization. Every natural complexity class can be characterized by
for some set . This conjectures that homological complexity completely classifies natural complexity classes. The source gives no resolution and does not specify which sets arise, so the claim 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.