Searching for "Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable." – 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.

Computing unsatisfiable k-SAT instances with few occurrences per variable
by Shlomo Hoory, Stefan Szeider — 2004 — Theoretical Computer Science
…Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable ⋆ Shlomo Hoory…
Cited by 3 (2 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB