5 citations · 5 across the 1 of their papers we have counts for
1 paper
Tero Laitinen, Tommi Junttila, Ilkka Niemelä
Instances of logical cryptanalysis, circuit verification, and bounded model checking can often be succinctly represented as a combined satisfiability (SAT) problem where an instanc…