Searching for "On the Hardness and Easiness of Random 4-SAT Formulas." – 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.

On the hardness and easiness of random 4-sat formulas
by Andreas Goerdt, André Lanka, Technische Universität Chemnitz, Fakultät Für Informatik — 2004 — In Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC
…On the hardness and easiness of random 4-SAT formulas Andreas Goerdt and André Lanka Technische…
Cited by 4 (0 self) – Add To MetaCart

Showing 1 through 1.

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