2 citations · 4 across the 11 of their papers we have counts for
1 paper · 2 filters
Thatchaphol Saranurak, Gorav Jindal
We show some facts regarding the question whether, for any number n, the length of the shortest Addition Multiplications Chain (AMC) computing n is polynomial in the length of…