Complexity conjecture for cohomology vanishing over finite -semirings
Complexity conjecture for cohomology vanishing over finite -semirings
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.
Sources & referencesView supporting material
Primary source
Chandrasekhar Gokavarapu and D. Madhusudhana Rao, “Derived Γ-Geometry, Sheaf Cohomology, and Homological Functors on the Spectrum of Commutative Ternary Γ-Semirings”, arXiv:2511.14108 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.