Search Results for ""

Informally, a function f:{0,1}^(l(n))×{0,1}^n->{0,1}^(m(n)) is a trapdoor one-way function if 1. It is a one-way function, and 2. For fixed public key y in {0,1}^(l(n)), ...

The blossom algorithm (Edmonds 1965) finds a maximum independent edge set in a (possibly weighted) graph. While a maximum independent edge set can be found fairly easily for ...

An algorithm for finding closed form hypergeometric identities. The algorithm treats sums whose successive terms have ratios which are rational functions. Not only does it ...

An algorithm for computing an Egyptian fraction.

A linear deconvolution algorithm.

An algorithm for computing an Egyptian fraction.

An algorithm for computing an Egyptian fraction.

An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...

A cipher is an algorithm that converts data (plaintext) to an obfuscated form that is not directly readable. Ciphers are usually used with the intention of hiding the ...

A strongly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...