Search Results for ""

A number of graphs are associated with P. J. Owens. The 76-node Owens graph (Owens 1980) provides the smallest known example of a polyhedral quintic nonhamiltonian graph. It ...

A problem is assigned to the P (polynomial time) class if there exists at least one algorithm to solve that problem, such that the number of steps of the algorithm is bounded ...

PEMDAS is an acronym used primarily in the United States as a mechanism to pedagogically enforce the order rules of computational precedence. PEMDAS is explained as follows: ...

An integer-relation algorithm which is based on a partial sum of squares approach, from which the algorithm takes its name.

The P versus NP problem is the determination of whether all NP-problems are actually P-problems. If P and NP are not equivalent, then the solution of NP-problems requires (in ...

The placement of objects so that they touch in some specified manner, often inside a container with specified properties. For example, one could consider a sphere packing, ...

If P(z) is a power series which is regular for |z|<=1 except for m poles within this circle and except for z=+1, at which points the function is assumed continuous when only ...

Following the work of Fuchs in classifying first-order ordinary differential equations, Painlevé studied second-order ordinary differential equation of the form ...

A set of two numbers or objects linked in some way is said to be a pair. The pair a and b is usually denoted (a, b), and is generally considered to be ordered, making it a ...

Given two paired sets X_i and Y_i of n measured values, the paired t-test determines whether they differ from each other in a significant way under the assumptions that the ...