dc.creatorVolpato, N
dc.creatorMoura, A
dc.date2009
dc.dateAUG
dc.date2014-11-16T04:43:51Z
dc.date2015-11-26T17:23:20Z
dc.date2014-11-16T04:43:51Z
dc.date2015-11-26T17:23:20Z
dc.date.accessioned2018-03-29T00:10:40Z
dc.date.available2018-03-29T00:10:40Z
dc.identifierInternational Journal Of Quantum Information. World Scientific Publ Co Pte Ltd, v. 7, n. 5, n. 935, n. 947, 2009.
dc.identifier0219-7499
dc.identifierWOS:000269123400006
dc.identifier10.1142/S0219749909005572
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/58266
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/58266
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/58266
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1283805
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionWe 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.
dc.description7
dc.description5
dc.description935
dc.description947
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionCNPq [140756/2004-3, 304363/2008-1]
dc.descriptionFAPESP [02/07473-7]
dc.languageen
dc.publisherWorld Scientific Publ Co Pte Ltd
dc.publisherSingapore
dc.publisherSingapura
dc.relationInternational Journal Of Quantum Information
dc.relationInt. J. Quantum Inf.
dc.rightsfechado
dc.sourceWeb of Science
dc.subjectQuantum computing
dc.subjectquantum algorithm
dc.subjectlower bound
dc.subjectupper bound
dc.subjectcomputational geometry
dc.subjectElement Distinctness
dc.subjectAlgorithms
dc.titleTIGHT QUANTUM BOUNDS FOR COMPUTATIONAL GEOMETRY PROBLEMS
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución