## Abstract

We study the problem of separating sublinear time computations via approximating the diameter for a sequence S = p1p2· · · pn of points in a metric space, in which any two consecutive points have the same distance. The computation is considered respectively under deterministic, zero error randomized, and bounded error randomized models. We obtain a class of separations using various versions of the approximate diameter problem based on restrictions on input data. We derive tight sublinear time separations for each of the three computation models via proving that computation with O(n ^{r}) time is strictly more powerful than that with O(n ^{r-ε}) time, where r and ε are arbitrary parameters in (0, 1) and (0, r) respectively.We show that, for any parameter r ε (0, 1), the bounded error randomized sublinear time computation in time O(n^{r} ) cannot be simulated by any zero error randomized sublinear time algorithm in o(n) time or queries; and the same is true for zero error randomized computation versus deterministic computation.

Original language | English (US) |
---|---|

Pages (from-to) | 393-416 |

Number of pages | 24 |

Journal | Journal of Combinatorial Optimization |

Volume | 18 |

Issue number | 4 |

DOIs | |

State | Published - Nov 2009 |

## Keywords

- Diameter
- Randomization
- Separation of complexity classes
- Sublinear time algorithm

## ASJC Scopus subject areas

- Computer Science Applications
- Discrete Mathematics and Combinatorics
- Control and Optimization
- Computational Theory and Mathematics
- Applied Mathematics