Searching for "Algorithms for Testing Satisfiability Formulas." – sorted by Relevance.

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

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

2 documents found, showing 1 through 2.

Phase Transition and Search Cost in the 2+p-SAT Problem
by Rémi Monasson, Riccardo Zecchina, Scott Kirkpatric, Bart Selman, Lidror Troyansky — 1996
… with N 28, and used an efficient depth-first search algorithm to test for satisfiability in formulae…
Cited by 9 (2 self) – Add To MetaCart

Phase Transition and Search Cost in the 2+p--SAT Problem
by Emi Monasson Cnrs-Laboratoire, Riccardo Zecchina, Scott Kirkpatrick, Bart Selman, Lidror Troyansky — 1996 — Proceedings of PhysComp 96
… with N 28, and used an efficient depth-first search algorithm to test for satisfiability in formulae…
Add To MetaCart

Showing 1 through 2.

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