tractability
11tractability — trac·ta·bil·i·ty …
12tractability — noun the trait of being easily persuaded • Syn: ↑tractableness, ↑flexibility • Ant: ↑intractability • Derivationally related forms: ↑flexible (for: ↑flexibility …
13tractable — tractability, tractableness, n. tractably, adv. /trak teuh beuhl/, adj. 1. easily managed or controlled; docile; yielding: a tractable child; a tractable disposition. 2. easily worked, shaped, or otherwise handled; malleable. [1495 1505; < L… …
14Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… …
15Vertex cover — In the mathematical discipline of graph theory, a vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. The problem of finding a minimum vertex cover is a classical… …
16The Fabric of Reality — is a 1997 book by physicist David Deutsch, which expands upon his views of quantum mechanics and its meanings for understanding reality.This interpretation, or what he calls the multiverse hypothesis, is one strand of a four strand theory of… …
17flexibility — noun 1. the property of being flexible; easily bent or shaped (Freq. 7) • Syn: ↑flexibleness • Ant: ↑inflexibility • Derivationally related forms: ↑flexible (for: ↑ …
18tractableness — noun the trait of being easily persuaded • Syn: ↑tractability, ↑flexibility • Ant: ↑intractability (for: ↑tractability) • Derivationally related forms: ↑f …
19Marginal utility — In economics, the marginal utility of a good or service is the utility gained (or lost) from an increase (or decrease) in the consumption of that good or service. Economists sometimes speak of a law of diminishing marginal utility, meaning that… …
20Clique 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… …
