Non-membership conjecture for the sign-imbalance problem in #P
Statement
For a poset , its sign imbalance is the absolute difference between the numbers of even and odd linear extensions. The computational problem Sign Imbalance takes a poset as input and outputs its sign imbalance; the class consists of functions counting accepting paths of nondeterministic polynomial-time computations. Sign Imbalance non-membership conjecture.
Sign imbalance is naturally in the counting-difference class , but the source states that its non-membership in 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.