ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let C\mathcal{C} be a natural complexity class, let h(Ln)h(L_n) denote the homological complexity of the restriction LnL_n of a problem LL to inputs of size nn, and let fC:N→Nf_{\mathcal{C}}:\mathbb{N}\to\mathbb{N}. Precise homological complexity characterization. For every natural complexity class C\mathcal{C}, there exists a function fCf_{\mathcal{C}} such that

C={L:h(Ln)≤fC(n) for all n}.\mathcal{C}=\{L:h(L_n)\leq f_{\mathcal{C}}(n)\text{ for all }n\}.

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 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.