The #P-hardness conjecture for counting pressing sequences
Statement
A graph has a set of pressing sequences, namely vertex orderings satisfying the pressing condition defined in the paper. The #P-hardness conjecture. Exactly counting the pressing sequences of a graph is #P-hard. The statement concerns the computational complexity of enumerating pressing sequences; the context explains that it cannot be obtained directly from the complexity of counting linear extensions because autonomous posets form only a subset of the series-parallel posets. Its resolution is not specified in the source.
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.