Search Results for ""

There exists no known P algorithm for graph isomorphism testing, although the problem has also not been shown to be NP-complete. In fact, the problem of identifying ...

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 ...

Associated with an irreducible curve of curve genus p, there are p linearly independent integrals of the first sort. The roots of the integrands are groups of the canonical ...

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; ...