Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (bibtex)
by
Reference:
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractableStefan Szeider2003, Technical report TR03-002, Revision 1, Electronic Colloquium on Computational Complexity (ECCC).
Bibtex Entry:
@string{eccc="Electronic Colloquium on Computational Complexity (ECCC)"}
@TechReport{Szeider03b,
  author = 	 {Stefan Szeider},
  title = 	 {Minimal unsatisfiable formulas with bounded 
                  clause-variable difference are fixed-parameter tractable},
  institution =  ECCC,
  number = 	 {TR03-002, Revision~1},
  year = 	 {2003},
  url   =        {http://eccc.hpi-web.de/report/2003/002/}
}
Powered by bibtexbrowser