On the Complexity of Approximate Sum of Sorted List

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38756-2_29 ◽

2013 ◽

pp. 284-293

Author(s):

Bin Fu

Download Full-text