Search Results for ""
191 - 200 of 492 for Spanning TreeSearch Results
A formula whose truth table contains only false in any interpretation is called unsatisfiable.
The self-intersection of a one-sided surface. The word "cross-cap" is sometimes also written without the hyphen as the single word "crosscap." The cross-cap can be thought of ...
A point lattice is a regularly spaced array of points. In the plane, point lattices can be constructed having unit cells in the shape of a square, rectangle, hexagon, etc. ...
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. A meet-endomorphism of L is a meet-homomorphism from L to L.
Inference of the truth of an unknown result obtained by noting its similarity to a result already known to be true. In the hands of a skilled mathematician, analogy can be a ...
A generalization of the Bulirsch-Stoer algorithm for solving ordinary differential equations.
Integers (lambda,mu) for a and b that satisfy Bézout's identity lambdaa+mub=GCD(a,b) are called Bézout numbers. For integers a_1, ..., a_n, the Bézout numbers are a set of ...
Let the nth composition of a function f(x) be denoted f^((n))(x), such that f^((0))(x)=x and f^((1))(x)=f(x). Denote the composition of f and g by f degreesg(x)=f(g(x)), and ...
The study of the nature and properties of bifurcations.
Involving two variables, as opposed to many (multivariate), or one (univariate).
...
View search results from all Wolfram sites (2800 matches)

