101 search results - page 8 / 21 » An Exact Quantum Polynomial-Time Algorithm for Simon's Probl... |
CORR
2002
Springer
13 years 7 months ago
2002
Springer
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
ICCAD
2007
IEEE
14 years 4 months ago
2007
IEEE
— The research in the field of reversible logic is motivated by its application in low-power design, optical computing and quantum computing. Hence synthesis of reversible logic...
DAM
1999
13 years 7 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
ICCV
2009
IEEE
13 years 5 months ago
2009
IEEE
We present a taxonomy for local distance functions where most existing algorithms can be regarded as approximations of the geodesic distance defined by a metric tensor. We categor...
BIRTHDAY
2009
Springer
14 years 2 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...