A fast parallel SAT-solver — efficient workload balancing

This publication has 10 references indexed in Scilit:

• Is average superlinear speedup possible?
  Published by Springer Nature ,2005
• Analysis of Two Simple Heuristics on a Random Instance ofk-sat
  Journal of Algorithms, 1996
• Approximating the unsatisfiability threshold of random formulas (Extended Abstract)
  Published by Springer Nature ,1996
• Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms
  SIAM Journal on Computing, 1991
• Solving satisfiability in less than 2n steps
  Discrete Applied Mathematics, 1985
• The intractability of resolution
  Theoretical Computer Science, 1985
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
  The Journal of Logic Programming, 1984
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971
• On the Complexity of Derivation in Propositional Calculus
  Published by Springer Nature ,1970
• A Computing Procedure for Quantification Theory
  Journal of the ACM, 1960