- tractable problem
- мат. легко разрешимая задача
Большой англо-русский и русско-английский словарь. 2001.
tractable problem
Смотреть что такое "tractable problem" в других словарях:
tractable — ► ADJECTIVE 1) easy to control or influence. 2) (of a situation or problem) easy to deal with. DERIVATIVES tractability noun. ORIGIN Latin tractabilis, from tractare to handle … English terms dictionary
tractable — [[t]træ̱ktəb(ə)l[/t]] ADJ GRADED If you say that a person, problem, or device is tractable, you mean that they can be easily controlled or dealt with. [FORMAL] He could easily manage his tractable and worshipping younger brother. ...the country s … English dictionary
tractable — adjective formal easy to control or deal with: Separating a problem into separate chunks often makes it more tractable. opposite intractable tractability noun (U) … Longman dictionary of contemporary English
tractable — adjective 1》 easy to control or influence. 2》 (of a situation or problem) easy to deal with. Derivatives tractability noun tractably adverb Origin C16: from L. tractabilis, from tractare (see tractate) … English new terms dictionary
Clique 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… … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
Vertex 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… … Wikipedia
NP-complete problem — ▪ computer science any of a class of computational problems for which no efficient solution algorithm has been found. Many significant computer science problems belong to this class e.g., the traveling salesman problem, satisfiability… … Universalium
P = NP problem — The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field – the Clay Mathematics Institute has offered a $1 million US prize… … Wikipedia
Constraint satisfaction problem — Constraint satisfaction problems (CSP)s are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite… … Wikipedia
Dominating 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… … Wikipedia
