11547 search results - page 65 / 2310 » Quantum computing and communication |
140
click to vote
ISMVL
2008
IEEE
15 years 10 months ago
2008
IEEE
The mathematical property of inheritance for certain unary fixed point operations has recently been exploited to enable the efficient formulation of arithmetic algorithms and circ...
147
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
119
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
136
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
100
click to vote
JCC
2007
15 years 3 months ago
2007
Abstract: The relative aromaticity of benzenoid rings in the linear polyacenes is investigated using two novel aromaticity approaches. According to the first, the aromaticity of i...