Search Results for ""
9871 - 9880 of 13135 for Non-Euclidean GeometrySearch Results
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: ...
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 ...
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 ...
The pair group of a group G is the group that acts on the 2-subsets of {1,...,p} whose permutations are induced by G. Pair groups can be calculated using PairGroup[g] in the ...
Given any set B, the associated pair groupoid is the set B×B with the maps alpha(a,b)=a and beta(a,b)=b, and multiplication (a,b)·(b,c)=(a,c). The inverse is ...
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 ...
Apply the 196-algorithm, which consists of taking any positive integer of two digits or more, reversing the digits, and adding to the original number. Now sum the two and ...
...
View search results from all Wolfram sites (30687 matches)

