8 citations · 14 across the 7 of their papers we have counts for
1 paper · 1 filter
Niklas Foos, Bastian Epping, Jannik Grundler +5
Constraint Satisfaction Problems (CSPs) lie at the heart of complexity theory and find application in a plethora of prominent tasks ranging from cryptography to genetics. Classical…