Polynomial-time conjecture for generalised clause-sets of bounded hermitian rank
Statement
Let the hermitian rank of a generalised clause-set be its rank under the hermitian conflict-matrix framework.
Bounded-hermitian-rank satisfiability conjecture. Satisfiability decision for generalised clause-sets can be done in polynomial time for bounded hermitian rank.
The source states that this is equivalent, via the nested translation preserving hermitian rank and hermitian defect, to Conjecture 15 of Galesi and Kullmann. No resolution is supplied.
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.