Efficient Data Structures for Backtrack Search SAT Solvers

By Lynce Inês  

Annals of Mathematics and Artificial Intelligence, Vol. 43, Iss. 1-4, 2005-01 ,pp. : 137-152

Springer Publishing Company

Access to resources Recommend Favorite

An Overview of Backtrack Search Satisfiability Algorithms

By Lynce I.  

Annals of Mathematics and Artificial Intelligence, Vol. 37, Iss. 3, 2003-03 ,pp. : 307-326

Springer Publishing Company

Access to resources Recommend Favorite

On SAT instance classes and a method for reliable performance experiments with SAT solvers

By Brglez Franc   Li Xiao   Stallmann Matthias  

Annals of Mathematics and Artificial Intelligence, Vol. 43, Iss. 1, 2005-01 ,pp. : 1-34

Springer Publishing Company

Access to resources Recommend Favorite

On SAT Instance Classes and a Method for Reliable Performance Experiments with SAT Solvers

By Brglez Franc   Li Xiao Yu   Stallmann Matthias F.  

Annals of Mathematics and Artificial Intelligence, Vol. 43, Iss. 1-4, 2005-01 ,pp. : 1-34

Springer Publishing Company

Access to resources Recommend Favorite

Efficient data structures for sparse network representation

By Hyvonen Jorkki   Saramaki Jari   Kaski Kimmo  

International Journal of Computer Mathematics, Vol. 85, Iss. 8, 2008-08 ,pp. : 1219-1233

Taylor & Francis Ltd

Access to resources Recommend Favorite