215 citations · 318 across the 83 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2020
Coarse-Grained Complexity for Dynamic Algorithms
Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak
To date, the only way to argue polynomial lower bounds for dynamic algorithms is via fine-grained complexity arguments. These arguments rely on strong assumptions about specific pr…
cs.CC2012★ 2 cited
Subtraction makes computing integers faster
Thatchaphol Saranurak, Gorav Jindal
We show some facts regarding the question whether, for any number , the length of the shortest Addition Multiplications Chain (AMC) computing is polynomial in the length of…