ACM Transactions on Computation Theory (TOCT): Volume 9 Issue 4, January 2018
Citation Count: 0
Downloads (6 Weeks): 18, Downloads (12 Months): 18, Downloads (Overall): 18
Full text available:
We investigate the parameters in terms of which the complexity of sublinear-time algorithms should be expressed. Our goal is to find input parameters that are tailored to the combinatorics of the specific problem being studied and design algorithms that run faster when these parameters are small. This direction enables us ...
monotonicity, Sublinear algorithms, parameterization, convexity, property testing