Search Results for ""

An extremely fast factorization method developed by Pollard which was used to factor the RSA-130 number. This method is the most powerful known for factoring general numbers, ...

Given an expression involving known constants, integration in finite terms, computation of limits, etc., the constant problem is the determination of if the expression is ...

A problem posed by L. Collatz in 1937, also called the 3x+1 mapping, 3n+1 problem, Hasse's algorithm, Kakutani's problem, Syracuse algorithm, Syracuse problem, Thwaites ...

The radical circle of the mixtilinear incircles has a center with trilinear center function alpha_(999)=cosA-2, (1) which is Kimberling center X_(999). It has radius (2) ...

A set of integers that give the orders of the blocks in a Jordan canonical form, with those integers corresponding to submatrices containing the same latent root bracketed ...

A computation is an operation that begins with some initial conditions and gives an output which follows from a definite set of rules. The most common example are ...

A Gröbner basis G for a system of polynomials A is an equivalence system that possesses useful properties, for example, that another polynomial f is a combination of those in ...

A maximum spanning tree is a spanning tree of a weighted graph having maximum weight. It can be computed by negating the weights for each edge and applying Kruskal's ...

For any constructible function f, there exists a function P_f such that for all functions t, the following two statements are equivalent: 1. There exists an algorithm A such ...

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