- In mathematics,
factorization (or factorisation, see
English spelling differences) or
factoring consists of
writing a
number or
another mathematical object...
-
Unsolved problem in
computer science: Can
integer factorization be
solved in
polynomial time on a
classical computer? (more
unsolved problems in computer...
- In
mathematics and
computer algebra,
factorization of
polynomials or
polynomial factorization expresses a
polynomial with
coefficients in a
given field...
- An RRQR
factorization or rank-revealing QR
factorization is a
matrix decomposition algorithm based on the QR
factorization which can be used to determine...
- In
number theory, an
aurifeuillean factorization,
named after Léon-François-Antoine Aurifeuille, is
factorization of
certain integer values of the cyclotomic...
- a k-
factorization partitions the
edges of the
graph into
disjoint k-factors. A
graph G is said to be k-factorable if it
admits a k-
factorization. In particular...
- In mathematics, a
unique factorization domain (UFD) (also
sometimes called a
factorial ring
following the
terminology of Bourbaki) is a ring in which...
- Non-negative
matrix factorization (NMF or NNMF), also non-negative
matrix approximation is a
group of
algorithms in
multivariate analysis and
linear algebra...
- In
linear algebra, a QR decomposition, also
known as a QR
factorization or QU
factorization, is a
decomposition of a
matrix A into a
product A = QR of...
- Pollard's rho
algorithm is an
algorithm for
integer factorization. It was
invented by John
Pollard in 1975. It uses only a
small amount of space, and...
