by Herbert Fleischner, Oliver Kullmann, Stefan Szeider
Reference:
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable differenceHerbert Fleischner, Oliver Kullmann, Stefan SzeiderTheoretical Computer Science, volume 289, number 1, pages 503-516, 2002.
Bibtex Entry:
@string{tcs="Theoretical Computer Science"}
@article {FleischnerKullmannSzeider02,
author = {Fleischner, Herbert and Kullmann, Oliver and Szeider, Stefan},
title = {Polynomial-time recognition of minimal unsatisfiable formulas
with fixed clause-variable difference},
journal = TCS,
volume = {289},
year = {2002},
number = {1},
pages = {503-516},
url = {https://www.ac.tuwien.ac.at/files/pub/fleischner-kullmann-szeider-2002.pdf},
gsid = {https://scholar.google.com/scholar?oi=bibs&hl=en&cites=15170626367980741704},
}