Polynomial-time satisfiability conjecture for multihitting generalised clause-sets
Statement
A multihitting clause-set is a generalised clause-set in which the associated conflict structure satisfies the multihitting condition. Satisfiability asks whether such a clause-set has a satisfying assignment.
Multihitting satisfiability conjecture. Satisfiability decision for multihitting generalised clause-sets can be done in polynomial time.
The conjecture is motivated by the equivalence between satisfiability for bihitting clause-sets and the hypergraph transversal problem, whose polynomial-time decidability is a longstanding open question. The source provides no resolution of this conjecture.
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.