Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank

@inproceedings{Galesi2004PolynomialTS,
  title={Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank},
  author={Nicola Galesi and Oliver Kullmann},
  booktitle={SAT},
  year={2004}
}
Combining graph theory and linear algebra, we study SAT problems of low “linear algebra complexity”, considering formulas with bounded hermitian rank. We show polynomial time SAT decision of the class of formulas with hermitian rank at most one, applying methods from hypergraph transversal theory. Applications to heuristics for SAT algorithms and to the structure of minimally unsatisfiable clause-sets are discussed. 

From This Paper

Topics from this paper.
11 Citations
24 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 24 references

The conflict matrix of (multi-)clause-sets — a link between combinatorics and (generalised) satisfiability problems

  • Oliver Kullmann
  • 2004
4 Excerpts

On the conflict matrix of clause-sets

  • Oliver Kullmann
  • Technical Report CSR 7-2003,
  • 2003
9 Excerpts

Similar Papers

Loading similar papers…