subset problem
71Tarski's circle-squaring problem — is the challenge, posed by Alfred Tarski in 1925, to take a disc in the plane, cut it into finitely many pieces, and reassemble the pieces so as to get a square of equal area. This was proven to be possible by Miklós Laczkovich in 1990; the… …
72Littlewood-Offord problem — In mathematics, the Littlewood Offord problem is the combinatorial question in geometry of describing usefully the distribution of the subsums made out of vectors: v 1, v 2, ..., v n , taken from a given Euclidean space of fixed dimension d ≥ 1.… …
73The Problem of the Wire Cage — infobox Book | name = The Problem of the Wire Cage title orig = translator = image caption = author = John Dickson Carr cover artist = country = United Kingdom language = English series = Gideon Fell genre = Mystery, Detective novel publisher =… …
74Neumann-Problem — Eine Neumann Randbedingung (nach Carl Gottfried Neumann) bezeichnet im Zusammenhang mit Differentialgleichungen (genauer: Randwertproblemen) Werte, die auf dem Rand des Definitionsbereichs für die Normalableitung der Lösung vorgegeben werden.… …
75Zero-sum problem — In number theory, zero sum problems are a certain class of combinatorial questions. In general, a finite abelian group G is considered. The zero sum problem for the integer n is the following: Find the smallest integer k such that any sequence of …
76Dirichlet-Problem — Als Dirichlet Randbedingung (nach Peter Gustav Lejeune Dirichlet) bezeichnet man im Zusammenhang mit Differentialgleichungen (genauer: Randwertproblemen), Werte, die auf dem jeweiligen Rand des Definitionsbereichs von der Funktion angenommen… …
77задача о сумме подмножеств — задача о рюкзаке — [http://www.rfcmd.ru/glossword/1.8/index.php?a=index d=4610] Тематики защита информации Синонимы задача о рюкзаке EN subset problem …
78combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… …
79NP (complexity) — Diagram of complexity classes provided that P ≠ NP. The existence of problems outside both P and NP complete in this case was established by Ladner.[1] In computational complexity theory, NP is one of the most fundamental complexity classes. The… …
80Matroid — In combinatorics, a branch of mathematics, a matroid (  /ˈmeɪ …
