Difficult Point Conjecture for monadic-second-order-definable graph polynomials
Statement
For every graph polynomial that is definable in monadic second-order logic and that is #P-hard to evaluate for at least one point, its evaluation is #P-hard for almost all points.
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.