Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable

@article{Szeider2004MinimalUF,
  title={Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable},
  author={Stefan Szeider},
  journal={J. Comput. Syst. Sci.},
  year={2004},
  volume={69},
  pages={656-674}
}
Recognition of minimal unsatisfiable CNF formulas (unsatisfiable CNF formulas which become satisfiable if any clause is removed) is a classical DP -complete problem. It was shown recently that minimal unsatisfiable formulas with n variables and n + k clauses can be recognized in time nO(k). We improve this result and present an algorithm with time complexity O(2kn4); hence the problem turns out to be fixed-parameter tractable (FPT) in the sense of Downey and Fellows (Parameterized Complexity… CONTINUE READING
10 Citations
33 References
Similar Papers

References

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

Matching Theory

  • L. Lovász, M. D. Plummer
  • volume 29 of Annals of Discrete Mathematics…
  • 1986
Highly Influential
8 Excerpts

Similar Papers

Loading similar papers…