Efficient computation of the degree of a neural ideal
Statement
Let and let be a code. A pseudo-monomial is an element of the canonical form of the neural ideal , and its degree is the number of factors in the pseudo-monomial.
Efficient degree computation conjecture. There is a polynomial-time algorithm that, given the codewords of as binary vectors of length , determines whether every pseudo-monomial in has degree at most .
Efficiently computing the canonical form is relevant to the proposed algorithm for recognizing inductively pierced codes, since the algorithm begins by computing . The supplied statement asserts the algorithm's existence but gives no resolution, so its status 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.