dc.creator | Volpato, N | |
dc.creator | Moura, A | |
dc.date | 2009 | |
dc.date | AUG | |
dc.date | 2014-11-16T04:43:51Z | |
dc.date | 2015-11-26T17:23:20Z | |
dc.date | 2014-11-16T04:43:51Z | |
dc.date | 2015-11-26T17:23:20Z | |
dc.date.accessioned | 2018-03-29T00:10:40Z | |
dc.date.available | 2018-03-29T00:10:40Z | |
dc.identifier | International Journal Of Quantum Information. World Scientific Publ Co Pte Ltd, v. 7, n. 5, n. 935, n. 947, 2009. | |
dc.identifier | 0219-7499 | |
dc.identifier | WOS:000269123400006 | |
dc.identifier | 10.1142/S0219749909005572 | |
dc.identifier | http://www.repositorio.unicamp.br/jspui/handle/REPOSIP/58266 | |
dc.identifier | http://www.repositorio.unicamp.br/handle/REPOSIP/58266 | |
dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/58266 | |
dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1283805 | |
dc.description | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
dc.description | 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. | |
dc.description | 7 | |
dc.description | 5 | |
dc.description | 935 | |
dc.description | 947 | |
dc.description | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
dc.description | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
dc.description | CNPq [140756/2004-3, 304363/2008-1] | |
dc.description | FAPESP [02/07473-7] | |
dc.language | en | |
dc.publisher | World Scientific Publ Co Pte Ltd | |
dc.publisher | Singapore | |
dc.publisher | Singapura | |
dc.relation | International Journal Of Quantum Information | |
dc.relation | Int. J. Quantum Inf. | |
dc.rights | fechado | |
dc.source | Web of Science | |
dc.subject | Quantum computing | |
dc.subject | quantum algorithm | |
dc.subject | lower bound | |
dc.subject | upper bound | |
dc.subject | computational geometry | |
dc.subject | Element Distinctness | |
dc.subject | Algorithms | |
dc.title | TIGHT QUANTUM BOUNDS FOR COMPUTATIONAL GEOMETRY PROBLEMS | |
dc.type | Artículos de revistas | |