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

by Stefan Szeider

Reference:

Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractableStefan SzeiderProceedings of the 9th International Computing and Combinatorics Conference (COCOON'03) (T. Warnow, B. Zhu, eds.), volume 2697 of Lecture Notes in Computer Science, pages 548-558, 2003, Springer Verlag.

Bibtex Entry:

@string{lncs="Lecture Notes in Computer Science"} @string{springer="Springer Verlag"} @InProceedings{Szeider03d, author = {Stefan Szeider}, title = {Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable}, booktitle = {Proceedings of the 9th International Computing and Combinatorics Conference (COCOON'03)}, year = {2003}, editor = {T. Warnow and B. Zhu}, volume = {2697}, series = LNCS, publisher = Springer, pages = {548-558}, }

Powered by bibtexbrowser