Complexity conjecture for cohomology vanishing over finite Γ-semirings
Statement
Let be a finite -semiring, and consider the problem of deciding whether
Complexity conjecture. This problem lies in , and becomes -complete for cyclic additive semirings. The claim gives a proposed complexity classification for computational -cohomology; the source supplies no resolution or supporting result.
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.