5 citations · 7 across the 4 of their papers we have counts for
1 paper · 1 filter
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…