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

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 V be a vector space over a field K, and let A be a nonempty set. For an appropriately defined affine space A, K is called the coefficient field.

Let a_1, a_2, ..., a_n be scalars not all equal to 0. Then the set S consisting of all vectors X=[x_1; x_2; |; x_n] in R^n such that a_1x_1+a_2x_2+...+a_nx_n=c for c a ...

A labeled binary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2 and 3, branches from these leading to 4, 5 and 6, 7, respectively, and so ...

A surface which is simultaneously complete and minimal. There have been a large number of fundamental breakthroughs in the study of such surfaces in recent years, and they ...

A labeled ternary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2, 3, 4, branches from these leading to 5, 6, 7 and 8, 9, 10 respectively, ...

An axiomatic theory (such as a geometry) is said to be complete if each valid statement in the theory is capable of being proven true or false.

A complete bipartite graph, sometimes also called a complete bicolored graph (Erdős et al. 1965) or complete bigraph, is a bipartite graph (i.e., a set of graph vertices ...

A function f(x) is completely convex in an open interval (a,b) if it has derivatives of all orders there and if (-1)^kf^((2k))(x)>=0 for k=0, 1, 2, ... in that interval ...