Search Results for ""
141 - 150 of 328 for Transitive reductionSearch Results
An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...
The term "continued fraction" is used to refer to a class of expressions of which generalized continued fraction of the form b_0+(a_1)/(b_1+(a_2)/(b_2+(a_3)/(b_3+...))) ...
Differential evolution is a stochastic parallel direct search evolution strategy optimization method that is fairly fast and reasonably robust. Differential evolution is ...
A graph is a forbidden minor if its presence as a graph minor of a given graph means it is not a member of some family of graphs. More generally, there may be a family of ...
A multiway system is a kind of substitution system in which multiple states are permitted at any stage. This accommodates rule systems in which there is more than one ...
The sequence of Fibonacci numbers {F_n} is periodic modulo any modulus m (Wall 1960), and the period (mod m) is the known as the Pisano period pi(m) (Wrench 1969). For m=1, ...
Determination of whether predicate P(x_1,...,x_n) is true or false for any given values of x_1, ..., x_n is called its decision problem. The decision problem for predicate ...
A set A of integers is said to be one-one reducible to a set B (A<<_1B) if there is a one-one recursive function f such that for every x, x in A=>f(x) in B (1) and f(x) in ...
The Risch algorithm is a decision procedure for indefinite integration that determines whether a given integral is elementary, and if so, returns a closed-form result for the ...
A graph corresponding to the skeleton of one of the Archimedean solids. There are 13 Archimedean graphs, all of which are regular, planar, polyhedral, and Hamiltonian. The ...
...
View search results from all Wolfram sites (2171 matches)

