tractability
21Robertson–Seymour theorem — In graph theory, the Robertson–Seymour theorem (also called the graph minor theorem[1]) states that the undirected graphs, partially ordered by the graph minor relationship, form a well quasi ordering.[2] Equivalently, every family of graphs that …
22Vertex cover problem — In computer science, the vertex cover problem or node cover problem is an NP complete problem and was one of Karp s 21 NP complete problems. It is often used in complexity theory to prove NP hardness of more complicated problems. Definition A… …
23Hitting set — The hitting set problem is an NP complete problem in set theory.For a given list of sets, a hitting set is a set of elements so that each set in the given list is touched by the hitting set.In the hitting set problem, the task is to find a small… …
24Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… …
25Quasi-Monte Carlo methods in finance — High dimensional integrals in hundreds or thousands of variables occur commonly in finance. These integrals have to be computed numerically to within a threshold epsilon. If the integral is of dimension d then in the worst case, where one has a… …
26Kernelization — In computer science, kernelization is a technique for creating algorithms for fixed parameter tractable problems. Given some language L, the input to a fixed parameter tractable problem is a pair (x, k) where x is a word from L and k is an… …
27Closest string — In theoretical computer science, closest string is the name of an NP hard computational problem, which tries to find the geometrical center of a set of input strings. To understand the word center it is necessary to define a distance between two… …
28Constrained Conditional Models — A Constrained Conditional Model (CCM) is a machine learning and inference framework that augments the learning of conditional (probabilistic or discriminative) models with declarative constraints. The constraint can be used as a way to… …
29manipulable — adjective easily managed (controlled or taught or molded) tractable young minds the natives...being...of an intelligent tractable disposition Samuel Butler • Syn: ↑tractable • Ant: ↑intractable (for: ↑tractable) …
30tractable — adjective Etymology: Latin tractabilis, from tractare to handle, treat Date: 1502 1. capable of being easily led, taught, or controlled ; docile < a tractable horse > 2. easily handled, managed, or wrought ; malleable Synonyms: see obedient •… …
