Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

TIGHT QUANTUM BOUNDS FOR COMPUTATIONAL GEOMETRY PROBLEMS

Full text
Author(s):
Volpato, Nilton [1] ; Moura, Arnaldo [1]
Total Authors: 2
Affiliation:
[1] Univ Estadual Campinas, Inst Comp, BR-13084971 Campinas, SP - Brazil
Total Affiliations: 1
Document type: Journal article
Source: INTERNATIONAL JOURNAL OF QUANTUM INFORMATION; v. 7, n. 5, p. 935-947, AUG 2009.
Web of Science Citations: 0
Abstract

We present new quantum lower bounds and upper bounds for several computational geometry problems. The bounds presented here improve on currently known results in a number of ways. We give asymptotically optimal bounds for one of the problems considered, and we provide, up to logarithmic factors, optimal bounds for a number of other problems and, in particular, we settle an open problem of Bahadur et al. Some of these new bounds are obtained using a general algorithm for finding a minimum pair over a given arbitrary order relation. (AU)

FAPESP's process: 02/07473-7 - Geometrically uniform codes in homogeneous spaces
Grantee:Sueli Irene Rodrigues Costa
Support Opportunities: Research Projects - Thematic Grants