TOPICS
Search

Search Results for ""


81 - 90 of 1205 for Shor's Algorithm ComplexitySearch Results
Parallel computing is the execution of a computer program utilizing multiple computer processors (CPU) concurrently instead of using one processor exclusively. Let T(n,1) be ...
A quadrature (numerical integration) algorithm which has a number of desirable properties.
Numerical stability refers to how a malformed input affects the execution of an algorithm. In a numerically stable algorithm, errors in the input lessen in significance as ...
A shuffling algorithm used in a class of random number generators.
An algorithm for computing an Egyptian fraction (Stewart 1992).
The security of a cryptosystem must not depend on keeping the cryptographic algorithm secret.
A maximal clique is a clique that cannot be extended by including one more adjacent vertex, meaning it is not a subset of a larger clique. A maximum clique (i.e., clique of ...
Let V(G) be the vertex set of a simple graph and E(G) its edge set. Then a graph isomorphism from a simple graph G to a simple graph H is a bijection f:V(G)->V(H) such that ...
The analytic summation of a hypergeometric series. Powerful general techniques of hypergeometric summation include Gosper's algorithm, Sister Celine's method, Wilf-Zeilberger ...
In August 2002, M. Agrawal and colleagues announced a deterministic algorithm for determining if a number is prime that runs in polynomial time (Agrawal et al. 2004). While ...
1 ... 6|7|8|9|10|11|12 ... 121 Previous Next

...