Searching for "Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques." – 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.

Certifying unsatisfiability of random 2k-sat formulas using approximation techniques
by Amin Coja-oghlan, Andreas Goerdt, André Lanka — 2003 — FCT
…Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques Amin Coja…
Cited by 5 (2 self) – Add To MetaCart

Showing 1 through 1.

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