8 citations · 12 across the 6 of their papers we have counts for
1 paper · 2 filters
Constantin Dalyac, Loïc Henriet, Emmanuel Jeandel +4
In order to qualify quantum algorithms for industrial NP-Hard problems, comparing them to available polynomial approximate classical algorithms and not only to exact ones -- expone…