Non-finite generation of semirings of p-cardinalities
Statement
Let be a standard complexity class, such as , , , or . Consider the semiring formed by the p-cardinalities of languages in , together with the corresponding semiring of equivalence classes of p-cardinalities.
Non-finite-generation conjecture. For every such complexity class , the semiring of p-cardinalities of languages in is not finitely generated. The same holds for the semiring of equivalence classes of p-cardinalities.
This predicts a strong algebraic complexity phenomenon even within standard complexity classes, including , , , and . The supplied text gives no resolution, so both non-finite-generation assertions remain 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.