AbstractāAs computing capabilities have increased, the coupling of computational models has become an increasingly viable and therefore important way of improving the physical ļ¬...
Wael R. Elwasif, David E. Bernholdt, Aniruddha G. ...
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
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...
Mitchell A. Thornton, David W. Matula, Laura Spenn...
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 ...
We consider the problem of testing the commutativity of a black-box group speciļ¬ed by its k generators. The complexity (in terms of k) of this problem was ļ¬rst considered by Pa...