study a problem
41Chess problem — Part of a series on Puzzles …
42Principal-agent problem — In political science and economics, the principal agent problem or agency dilemma treats the difficulties that arise under conditions of incomplete and asymmetric information when a principal hires an agent. Various mechanisms may be used to try… …
43Euler's three-body problem — In physics and astronomy, Euler s three body problem is to solve for the motion of a particle that is acted upon by the gravitational field of two other point masses that are either fixed in space or move in circular coplanar orbits about their… …
44Galton's problem — Galton’s problem, named after Sir Francis Galton, is the problem of drawing inferences from cross cultural data, due to the statistical phenomenon now called autocorrelation. The problem is now recognized as a general one that applies to all… …
45British Doctors Study — The British doctors study is the generally accepted name of a prospective cohort study which has been running from 1951 to 2001, and in 1956 provided convincing statistical proof that tobacco smoking increased the risk of lung… …
46A Study in Scarlet (1933) — Filmdaten Originaltitel A Study in Scarlet Produktionsland USA …
47Mixing study — Mixing studies are tests performed on blood plasma used to distinguish factor deficiencies from factor inhibitors, such as lupus anticoagulant, or specific factor inhibitors, such as antibodies directed against factor VIII. Mixing studies take… …
48Galton's problem — The Galton problem is named after Francis Galton, the nineteenth century British polymath, who became embroiled in a celebrated exchange about the logic of comparative analysis with the anthropologist Edward Tylor . In 1889, Tylor published an… …
49Word problem for groups — In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a recursively presented group G is the algorithmic problem of deciding whether two words represent the same element. Although it… …
50Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …
