3 citations · 5 across the 6 of their papers we have counts for
1 paper · 1 filter
Alexander Tornede, Lukas Gehring, Tanja Tornede +2
The problem of selecting an algorithm that appears most suitable for a specific instance of an algorithmic problem class, such as the Boolean satisfiability problem, is called inst…