intractability
51Franz Boas — Infobox Person name = Franz Boas image size = 200px caption = birth date = birth date|1858|7|9 birth place = Minden, [www.franz boas.com further information about the commemoration of the 150th anniversary of Boas´ birth at Minden e. g. an… …
52Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… …
53Knapsack problem — BKP redirects here. For other uses, see BKP (disambiguation). Example of a one dimensional (constraint) knapsack problem: which boxes should be chosen to maximize the amount of money while still keeping the overall weight under or equal to… …
54Meditation — This article is about the mental discipline. For the form of alternative dispute resolution, see Mediation. For other uses, see Meditation (disambiguation). A statue of the Buddha meditating, Borim Temple, Korea Meditation refers to any form of a …
55Modular arithmetic — In mathematics, modular arithmetic (sometimes called clock arithmetic) is a system of arithmetic for integers, where numbers wrap around after they reach a certain value the modulus. The Swiss mathematician Leonhard Euler pioneered the modern… …
56Sudan — This article is about the country. For the geographical region, see Sudan (region). For the state that seceded from Sudan, see South Sudan. For other uses, see Sudan (disambiguation). Republic of the Sudan جمهورية السودان Jumhūrīyat as Sūdān …
57Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …
58Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …
59NP-hard — For a gentler introduction, see P versus NP problem. Euler diagram for P, NP, NP complete, and NP hard set of problems NP hard (non deterministic polynomial time hard), in computational complexity theory, is a class of problems that are,… …
60NP-easy — In complexity theory, the complexity class NP easy is the set of function problems that are solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP. In other words, a problem X is NP easy if… …
