problem of reduction
51Poverty reduction — (or poverty alleviation ) is any process which seeks to reduce the level of poverty in a community, or amongst a group of people or countries. Poverty reduction programs may be aimed at economic or non economic poverty. Some of the popular… …
52Transformation problem — In 20th century discussions of Karl Marx s economics the transformation problem is the problem of finding a general rule to transform the values of commodities (based on labour according to his labour theory of value) into the competitive prices… …
53Relation reduction — In logic and mathematics, relation reduction and relational reducibility have to do with the extent to which a given relation is determined by an indexed family or a sequence of other relations, called the relation dataset . The relation under… …
54Lenstra–Lenstra–Lovász lattice basis reduction algorithm — The Lenstra–Lenstra–Lovász lattice basis reduction (LLL) is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász. Given as input d lattice basis vectors with n dimensional integer coordinates… …
553-partition problem — The 3 partition problem is an NP complete problem in computer science. The problem is to decide whether a given multiset of integers can be partitioned into triples that all have the same sum. More precisely, given a multiset S of n = 3 m… …
56Tobacco harm reduction — describes actions taken to lower the health risks associated with using tobacco or nicotine. These measures include:#Switching to Western smokeless tobacco #Switching to non tobacco sources of nicotine #Smoking safer or fewer cigarettes… …
57Subgraph isomorphism problem — In complexity theory, Subgraph Isomorphism is a decision problem that is known to be NP complete. The formal description of the decision problem is as follows.Subgraph Isomorphism(G1, G2) Input: Two graphs G1 and G2. Question: Is G1 isomorphic to …
58Partial order reduction — In computer science, partial order reduction is a technique for reducing the size of the state space to be searched by a model checking algorithm. It exploits the commutativity of concurrently executed transitions, which result in the same state… …
59First-order reduction — A first order reduction is a very weak type of reduction between two computational problems in computational complexity theory. A first order reduction is a reduction where each component is restricted to be in the class FO of problems calculable …
60Solar neutrino problem — The solar neutrino problem was a major discrepancy between measurements of the numbers of neutrinos flowing through the earth and theoretical models of the solar interior, lasting from the mid 1960s to about 2002. The discrepancy has since been… …
