37 citations · 55 across the 7 of their papers we have counts for
1 paper · 1 filter
David W. Zhang, Corrado Rainone, Markus Peschl +1
Finding the best way to schedule operations in a computation graph is a classical NP-hard problem which is central to compiler optimization. However, evaluating the goodness of a s…