Search Results for ""

A problem which is both NP (verifiable in nondeterministic polynomial time) and NP-hard (any NP-problem can be translated into this problem). Examples of NP-hard problems ...

Let |z| be a vector norm of a vector z such that ||A||=max_(|z|=1)||Az||. Then ||A|| is a matrix norm which is said to be the natural norm induced (or subordinate) to the ...

A simple unlabeled graph on n vertices is called pancyclic if it contains cycles of all lengths, 3, 4, ..., n. Since a pancyclic graph must contain a cycle of length n, ...

The n-path complement graph P^__n is the graph complement of the path graph P_n. The first few are illustrated above. Since P_4 is self-complementary, P^__4 is isomorphic to ...

The pentagonal antiprism is the antiprism having a regular pentagon for the top and bottom bases. It is also the uniform polyhedron with Maeder index 77 (Maeder 1997) and ...

A permutation matrix is a matrix obtained by permuting the rows of an n×n identity matrix according to some permutation of the numbers 1 to n. Every row and column therefore ...

The highest order power in a univariate polynomial is known as its order (or, more properly, its polynomial degree). For example, the polynomial ...

A real-valued univariate function f=f(x) is said to have a removable discontinuity at a point x_0 in its domain provided that both f(x_0) and lim_(x->x_0)f(x)=L<infty (1) ...

A Schauder basis for a Banach space X is a sequence {x_n} in X with the property that every x in X has a unique representation of the form x=sum_(n=1)^(infty)alpha_nx_n for ...

A mechanical device consisting of a sliding portion and a fixed case, each marked with logarithmic axes. By lining up the ticks, it is possible to do multiplication by taking ...