2 citations · 5 across the 14 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.CC2014
Easy/Hard Transition in k-SAT
Bernd R. Schuh
A heuristic model procedure for determining satisfiability of CNF-formulae is set up and described by nonlinear recursion relations for m (number of clauses), n (number of variable…
cs.CC2014★ 1 cited
SAT for pedestrians
Bernd R. Schuh
The aim of this short note is mainly pedagogical. It summarizes some knowledge about Boolean satisfiability (SAT) and the P=NP? problem in an elementary mathematical language. A co…