subset problem
51Maximum satisfiability problem — In computational complexity theory, the Maximum Satisfiability problem (MAX SAT) is the problem of determining the maximum number of clauses, of a given Boolean formula, that can be satisfied by some assignment. It is an FNP generalization of SAT …
52Two Generals' Problem — In computing, the Two Generals Problem is a thought experiment meant to illustrate the pitfalls and design challenges of attempting to coordinate an action by communicating over an unreliable link. It is related to the more general Byzantine… …
53Correspondence problem — For the problem in theory of computation, see Post correspondence problem. The correspondence problem tries to figure out which parts of an image correspond to which parts of another image, after the camera has moved, time has elapsed, and/or the …
54Generalized assignment problem — In applied mathematics, the maximum general assignment problem is a problem in combinatorial optimization. This problem is a generalization of the assignment problem in which both tasks and agents have a size. Moreover, the size of each task… …
55Elliptic boundary value problem — In mathematics, an elliptic boundary value problem is a special kind of boundary value problem which can be thought of as the stable state of an evolution problem. For example, the Dirichlet problem for the Laplacian gives the eventual… …
56Quantum mind–body problem — The quantum mind–body problem refers to the philosophical discussions of the mind–body problem in the context of quantum mechanics. Since quantum mechanics involves quantum superpositions, which are not perceived by observers, some… …
57Dominating set problem — The dominating set problem is an NP complete problem in graph theory.DefinitionAn instance of the dominating set problem consists of: * a graph G with a set V of vertices and a set E of edges, and * a positive integer K smaller than or equal to… …
58Bargaining problem — The two person bargaining problem is a problem of understanding how two agents should cooperate when non cooperation leads to Pareto inefficient results. It is in essence an equilibrium selection problem; Many games have multiple equilibria with… …
59Bin packing problem — In computational complexity theory, the bin packing problem is a combinatorial NP hard problem. In it, objects of different volumes must be packed into a finite number of bins of capacity V in a way that minimizes the number of bins used.There… …
60Word problem (computability) — In computability theory, the word problem is a decision problem concerning formal languages. The problem is to construct an algorithm to decide for a given word if it belongs to a formal language or not.Word problemGiven a formal language L… …
