Searching for "Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
by Herbert Fleischner, Oliver Kullmann, Stefan Szeider A — 2000 — Theoretical Computer Science
…August 2001 Polynomial–Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause–Variable…
Cited by 27 (9 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB