- reduction theorem
- мат. редукционная теорема
Большой англо-русский и русско-английский словарь. 2001.
reduction theorem
Смотреть что такое "reduction theorem" в других словарях:
Theorem — The Pythagorean theorem has at least 370 known proofs[1] In mathematics, a theorem is a statement that has been proven on the basis of previously established statements, such as other theorems, and previously accepted statements … Wikipedia
Reduction of the structure group — In mathematics, in particular the theory of principal bundles, one can ask if a G bundle comes from a subgroup H < G. This is called reduction of the structure group (to H), and makes sense for any map H o G, which need not be an inclusion… … Wikipedia
Reduction (recursion theory) — In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated by the question: given sets A and B of natural numbers, is it possible to effectively… … Wikipedia
Uncertainty reduction theory — was introduced in 1975 in a paper entitled Some Exploration in Initial Interaction and Beyond: Toward a Developmental Theory of Interpersonal Communication . This theory, a collaborative effort of Charles R. Berger and Richard J. Calabrese, was… … Wikipedia
Ham sandwich theorem — In measure theory, a branch of mathematics, the ham sandwich theorem, also called the Stone–Tukey theorem after Arthur H. Stone and John Tukey, states that given n objects in n dimensional space, it is possible to divide all of them in half… … Wikipedia
Valiant-Vazirani theorem — The Valiant Vazirani Theorem was proven by Leslie Valiant and Vijay Vazirani in their paper titled NP is as easy as detecting unique solutions published in 1986. The theorem states that if there is a polynomial time algorithm for UNIQUE SAT, then … Wikipedia
Faltings' theorem — In number theory, the Mordell conjecture is the conjecture made by Mordell (1922) that a curve of genus greater than 1 over the field Q of rational numbers has only finitely many rational points. The conjecture was later generalized by replacing… … Wikipedia
Cook–Levin theorem — In computational complexity theory, the Cook–Levin theorem, also known as Cook s theorem, states that the Boolean satisfiability problem is NP complete. That is, any problem in NP can be reduced in polynomial time by a deterministic Turing… … Wikipedia
Four color theorem — Example of a four colored map A four colori … Wikipedia
De Bruijn–Erdős theorem (graph theory) — This article is about coloring infinite graphs. For the number of lines determined by a finite set of points, see De Bruijn–Erdős theorem (incidence geometry). In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and… … Wikipedia
Poincaré–Birkhoff–Witt theorem — In the theory of Lie algebras, the Poincaré–Birkhoff–Witt theorem (Poincaré (1900), G. D. Birkhoff (1937), Witt (1937); frequently contracted to PBW theorem) is a result giving an explicit description of the universal enveloping algebra of a Lie… … Wikipedia
